./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:15:40,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:15:40,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:15:40,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:15:40,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:15:40,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:15:40,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:15:40,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:15:40,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:15:40,624 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:15:40,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:15:40,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:15:40,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:15:40,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:15:40,626 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:15:40,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:15:40,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:15:40,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:15:40,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:15:40,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:15:40,627 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:15:40,627 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:15:40,627 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:15:40,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:15:40,627 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:15:40,627 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:15:40,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:15:40,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:15:40,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:15:40,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:15:40,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:40,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:40,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:40,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:40,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:15:40,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:40,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:40,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:40,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:15:40,630 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-01-10 01:15:40,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:15:40,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:15:40,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:15:40,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:15:40,941 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:15:40,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-01-10 01:15:42,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8cab989/297bb87d055045c5bdb5eebf3603df82/FLAGa4f859cec [2025-01-10 01:15:42,826 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:15:42,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-01-10 01:15:42,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8cab989/297bb87d055045c5bdb5eebf3603df82/FLAGa4f859cec [2025-01-10 01:15:42,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8cab989/297bb87d055045c5bdb5eebf3603df82 [2025-01-10 01:15:42,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:15:42,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:15:42,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:42,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:15:42,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:15:42,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:42" (1/1) ... [2025-01-10 01:15:42,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c867a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:42, skipping insertion in model container [2025-01-10 01:15:42,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:42" (1/1) ... [2025-01-10 01:15:43,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:15:44,513 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:44,518 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:44,518 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:44,523 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:44,523 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:45,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:45,178 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:15:45,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-01-10 01:15:45,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-01-10 01:15:45,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-01-10 01:15:45,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-01-10 01:15:45,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-01-10 01:15:45,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-01-10 01:15:45,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-01-10 01:15:45,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-01-10 01:15:45,287 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-01-10 01:15:45,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-01-10 01:15:45,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-01-10 01:15:45,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-01-10 01:15:45,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-01-10 01:15:45,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-01-10 01:15:45,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-01-10 01:15:45,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-01-10 01:15:45,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-01-10 01:15:45,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-01-10 01:15:45,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-01-10 01:15:45,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-01-10 01:15:45,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-01-10 01:15:45,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-01-10 01:15:45,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-01-10 01:15:45,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-01-10 01:15:45,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-01-10 01:15:45,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-01-10 01:15:45,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-01-10 01:15:45,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-01-10 01:15:45,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-01-10 01:15:45,293 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-01-10 01:15:45,293 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-01-10 01:15:45,293 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-01-10 01:15:45,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-01-10 01:15:45,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-01-10 01:15:45,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-01-10 01:15:45,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-01-10 01:15:45,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-01-10 01:15:45,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-01-10 01:15:45,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-01-10 01:15:45,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-01-10 01:15:45,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-01-10 01:15:45,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-01-10 01:15:45,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-01-10 01:15:45,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-01-10 01:15:45,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-01-10 01:15:45,301 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-01-10 01:15:45,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-01-10 01:15:45,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-01-10 01:15:45,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-01-10 01:15:45,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-01-10 01:15:45,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-01-10 01:15:45,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-01-10 01:15:45,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-01-10 01:15:45,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-01-10 01:15:45,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-01-10 01:15:45,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-01-10 01:15:45,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-01-10 01:15:45,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-01-10 01:15:45,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-01-10 01:15:45,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-01-10 01:15:45,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-01-10 01:15:45,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-01-10 01:15:45,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-01-10 01:15:45,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-01-10 01:15:45,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-01-10 01:15:45,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-01-10 01:15:45,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-01-10 01:15:45,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-01-10 01:15:45,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-01-10 01:15:45,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-01-10 01:15:45,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-01-10 01:15:45,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-01-10 01:15:45,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-01-10 01:15:45,316 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-01-10 01:15:45,316 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-01-10 01:15:45,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-01-10 01:15:45,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-01-10 01:15:45,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-01-10 01:15:45,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-01-10 01:15:45,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-01-10 01:15:45,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-01-10 01:15:45,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-01-10 01:15:45,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-01-10 01:15:45,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-01-10 01:15:45,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-01-10 01:15:45,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-01-10 01:15:45,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-01-10 01:15:45,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-01-10 01:15:45,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-01-10 01:15:45,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-01-10 01:15:45,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-01-10 01:15:45,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-01-10 01:15:45,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-01-10 01:15:45,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-01-10 01:15:45,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-01-10 01:15:45,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-01-10 01:15:45,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-01-10 01:15:45,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-01-10 01:15:45,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-01-10 01:15:45,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-01-10 01:15:45,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:45,679 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:15:45,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45 WrapperNode [2025-01-10 01:15:45,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:45,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:45,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:15:45,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:15:45,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,844 INFO L138 Inliner]: procedures = 921, calls = 972, calls flagged for inlining = 848, calls inlined = 84, statements flattened = 850 [2025-01-10 01:15:45,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:45,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:15:45,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:15:45,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:15:45,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,905 INFO L175 MemorySlicer]: Split 50 memory accesses to 4 slices as follows [2, 28, 18, 2]. 56 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 7, 6, 0]. The 15 writes are split as follows [0, 9, 5, 1]. [2025-01-10 01:15:45,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:15:45,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:15:45,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:15:45,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:15:45,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (1/1) ... [2025-01-10 01:15:45,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:46,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:15:46,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:15:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:15:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:15:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:15:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 01:15:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:15:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:15:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:15:46,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-01-10 01:15:46,042 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 01:15:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 01:15:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:15:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:15:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:15:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 01:15:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:15:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:15:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:15:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 01:15:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 01:15:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:15:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:15:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:15:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 01:15:46,046 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:15:46,255 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:15:46,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:15:47,487 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:15:47,487 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:15:48,010 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:15:48,011 INFO L312 CfgBuilder]: Removed 53 assume(true) statements. [2025-01-10 01:15:48,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:48 BoogieIcfgContainer [2025-01-10 01:15:48,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:15:48,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:15:48,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:15:48,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:15:48,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:15:42" (1/3) ... [2025-01-10 01:15:48,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584d8134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:48, skipping insertion in model container [2025-01-10 01:15:48,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:45" (2/3) ... [2025-01-10 01:15:48,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584d8134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:48, skipping insertion in model container [2025-01-10 01:15:48,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:48" (3/3) ... [2025-01-10 01:15:48,020 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-01-10 01:15:48,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:15:48,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 356 locations, 1 initial locations, 60 loop locations, and 88 error locations. [2025-01-10 01:15:48,038 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:15:48,293 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 01:15:48,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 359 places, 513 transitions, 1033 flow [2025-01-10 01:15:48,483 INFO L124 PetriNetUnfolderBase]: 170/557 cut-off events. [2025-01-10 01:15:48,485 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:15:48,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 557 events. 170/557 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2205 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 418. Up to 6 conditions per place. [2025-01-10 01:15:48,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 359 places, 513 transitions, 1033 flow [2025-01-10 01:15:48,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 359 places, 513 transitions, 1033 flow [2025-01-10 01:15:48,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:15:48,541 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;@45b6523b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:15:48,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 154 error locations. [2025-01-10 01:15:48,545 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:15:48,546 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 01:15:48,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:15:48,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:48,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 01:15:48,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:48,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash 100750, now seen corresponding path program 1 times [2025-01-10 01:15:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062078259] [2025-01-10 01:15:48,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:48,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:48,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 01:15:48,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 01:15:48,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062078259] [2025-01-10 01:15:48,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062078259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:48,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:48,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911598876] [2025-01-10 01:15:48,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:48,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:49,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:49,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:49,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:49,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 513 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:49,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:49,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:49,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:50,216 INFO L124 PetriNetUnfolderBase]: 1543/4307 cut-off events. [2025-01-10 01:15:50,216 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:50,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7216 conditions, 4307 events. 1543/4307 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33357 event pairs, 1240 based on Foata normal form. 1997/5510 useless extension candidates. Maximal degree in co-relation 7066. Up to 2900 conditions per place. [2025-01-10 01:15:50,243 INFO L140 encePairwiseOnDemand]: 378/513 looper letters, 190 selfloop transitions, 4 changer transitions 0/365 dead transitions. [2025-01-10 01:15:50,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 365 transitions, 1125 flow [2025-01-10 01:15:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2025-01-10 01:15:50,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5445094217024041 [2025-01-10 01:15:50,268 INFO L175 Difference]: Start difference. First operand has 359 places, 513 transitions, 1033 flow. Second operand 3 states and 838 transitions. [2025-01-10 01:15:50,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 365 transitions, 1125 flow [2025-01-10 01:15:50,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 365 transitions, 1125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:50,283 INFO L231 Difference]: Finished difference. Result has 337 places, 365 transitions, 745 flow [2025-01-10 01:15:50,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=337, PETRI_TRANSITIONS=365} [2025-01-10 01:15:50,290 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -22 predicate places. [2025-01-10 01:15:50,290 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 365 transitions, 745 flow [2025-01-10 01:15:50,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:50,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:50,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 01:15:50,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:15:50,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:50,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash 100751, now seen corresponding path program 1 times [2025-01-10 01:15:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005103894] [2025-01-10 01:15:50,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:50,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 01:15:50,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 01:15:50,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:50,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:50,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005103894] [2025-01-10 01:15:50,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005103894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:50,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88251599] [2025-01-10 01:15:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:50,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:50,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:50,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:50,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 365 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:50,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:50,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:51,467 INFO L124 PetriNetUnfolderBase]: 1543/4306 cut-off events. [2025-01-10 01:15:51,468 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:51,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7219 conditions, 4306 events. 1543/4306 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33409 event pairs, 1240 based on Foata normal form. 0/3514 useless extension candidates. Maximal degree in co-relation 7194. Up to 2901 conditions per place. [2025-01-10 01:15:51,496 INFO L140 encePairwiseOnDemand]: 510/513 looper letters, 191 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2025-01-10 01:15:51,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 364 transitions, 1129 flow [2025-01-10 01:15:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2025-01-10 01:15:51,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45938921377517866 [2025-01-10 01:15:51,499 INFO L175 Difference]: Start difference. First operand has 337 places, 365 transitions, 745 flow. Second operand 3 states and 707 transitions. [2025-01-10 01:15:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 364 transitions, 1129 flow [2025-01-10 01:15:51,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 364 transitions, 1121 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:51,507 INFO L231 Difference]: Finished difference. Result has 336 places, 364 transitions, 739 flow [2025-01-10 01:15:51,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=336, PETRI_TRANSITIONS=364} [2025-01-10 01:15:51,508 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -23 predicate places. [2025-01-10 01:15:51,509 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 364 transitions, 739 flow [2025-01-10 01:15:51,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:51,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:51,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:15:51,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:15:51,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:51,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash 96924877, now seen corresponding path program 1 times [2025-01-10 01:15:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832672043] [2025-01-10 01:15:51,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:51,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:15:51,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:15:51,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:51,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:51,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:51,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832672043] [2025-01-10 01:15:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832672043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:51,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:51,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951875120] [2025-01-10 01:15:51,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:51,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:15:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:51,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:15:51,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:15:51,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:51,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 364 transitions, 739 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:51,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:51,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:51,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:52,729 INFO L124 PetriNetUnfolderBase]: 1543/4304 cut-off events. [2025-01-10 01:15:52,730 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:52,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7213 conditions, 4304 events. 1543/4304 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33330 event pairs, 1240 based on Foata normal form. 0/3513 useless extension candidates. Maximal degree in co-relation 7201. Up to 2891 conditions per place. [2025-01-10 01:15:52,790 INFO L140 encePairwiseOnDemand]: 505/513 looper letters, 185 selfloop transitions, 6 changer transitions 0/362 dead transitions. [2025-01-10 01:15:52,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 362 transitions, 1117 flow [2025-01-10 01:15:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:15:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:15:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1048 transitions. [2025-01-10 01:15:52,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40857699805068226 [2025-01-10 01:15:52,795 INFO L175 Difference]: Start difference. First operand has 336 places, 364 transitions, 739 flow. Second operand 5 states and 1048 transitions. [2025-01-10 01:15:52,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 362 transitions, 1117 flow [2025-01-10 01:15:52,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 362 transitions, 1113 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:52,801 INFO L231 Difference]: Finished difference. Result has 336 places, 362 transitions, 743 flow [2025-01-10 01:15:52,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=743, PETRI_PLACES=336, PETRI_TRANSITIONS=362} [2025-01-10 01:15:52,803 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -23 predicate places. [2025-01-10 01:15:52,803 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 362 transitions, 743 flow [2025-01-10 01:15:52,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:52,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:52,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:15:52,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:15:52,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:52,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash 96924878, now seen corresponding path program 1 times [2025-01-10 01:15:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564916217] [2025-01-10 01:15:52,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:15:52,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:15:52,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:52,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:53,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564916217] [2025-01-10 01:15:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564916217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:53,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:53,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:53,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774206732] [2025-01-10 01:15:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:15:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:53,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:15:53,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:15:53,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:53,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 362 transitions, 743 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:53,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:53,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:53,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:54,081 INFO L124 PetriNetUnfolderBase]: 1543/4303 cut-off events. [2025-01-10 01:15:54,081 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:54,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7215 conditions, 4303 events. 1543/4303 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33348 event pairs, 1240 based on Foata normal form. 0/3513 useless extension candidates. Maximal degree in co-relation 7185. Up to 2891 conditions per place. [2025-01-10 01:15:54,112 INFO L140 encePairwiseOnDemand]: 508/513 looper letters, 186 selfloop transitions, 4 changer transitions 0/361 dead transitions. [2025-01-10 01:15:54,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 361 transitions, 1121 flow [2025-01-10 01:15:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:15:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:15:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1046 transitions. [2025-01-10 01:15:54,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4077972709551657 [2025-01-10 01:15:54,117 INFO L175 Difference]: Start difference. First operand has 336 places, 362 transitions, 743 flow. Second operand 5 states and 1046 transitions. [2025-01-10 01:15:54,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 361 transitions, 1121 flow [2025-01-10 01:15:54,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 361 transitions, 1109 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:15:54,124 INFO L231 Difference]: Finished difference. Result has 335 places, 361 transitions, 737 flow [2025-01-10 01:15:54,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=737, PETRI_PLACES=335, PETRI_TRANSITIONS=361} [2025-01-10 01:15:54,126 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -24 predicate places. [2025-01-10 01:15:54,127 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 361 transitions, 737 flow [2025-01-10 01:15:54,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:54,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:54,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:54,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:15:54,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:54,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1273856499, now seen corresponding path program 1 times [2025-01-10 01:15:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:54,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024865719] [2025-01-10 01:15:54,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:54,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:15:54,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:15:54,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:54,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:54,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024865719] [2025-01-10 01:15:54,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024865719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:54,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:54,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:15:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883055681] [2025-01-10 01:15:54,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:54,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:15:54,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:54,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:15:54,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:15:54,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:54,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 361 transitions, 737 flow. Second operand has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:54,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:54,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:54,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:55,665 INFO L124 PetriNetUnfolderBase]: 1543/4302 cut-off events. [2025-01-10 01:15:55,665 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:55,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7211 conditions, 4302 events. 1543/4302 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 33305 event pairs, 1240 based on Foata normal form. 0/3514 useless extension candidates. Maximal degree in co-relation 7185. Up to 2891 conditions per place. [2025-01-10 01:15:55,688 INFO L140 encePairwiseOnDemand]: 506/513 looper letters, 183 selfloop transitions, 6 changer transitions 0/360 dead transitions. [2025-01-10 01:15:55,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 360 transitions, 1113 flow [2025-01-10 01:15:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:15:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:15:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1216 transitions. [2025-01-10 01:15:55,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2025-01-10 01:15:55,693 INFO L175 Difference]: Start difference. First operand has 335 places, 361 transitions, 737 flow. Second operand 6 states and 1216 transitions. [2025-01-10 01:15:55,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 360 transitions, 1113 flow [2025-01-10 01:15:55,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 360 transitions, 1105 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:15:55,701 INFO L231 Difference]: Finished difference. Result has 335 places, 360 transitions, 739 flow [2025-01-10 01:15:55,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=739, PETRI_PLACES=335, PETRI_TRANSITIONS=360} [2025-01-10 01:15:55,704 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -24 predicate places. [2025-01-10 01:15:55,705 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 360 transitions, 739 flow [2025-01-10 01:15:55,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:55,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:55,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:55,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:15:55,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:55,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash -863301405, now seen corresponding path program 1 times [2025-01-10 01:15:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:55,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212240152] [2025-01-10 01:15:55,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:55,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:15:55,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:15:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:55,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:55,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:55,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212240152] [2025-01-10 01:15:55,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212240152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:55,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:55,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:55,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015981904] [2025-01-10 01:15:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:55,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:55,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:55,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:55,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:55,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 360 transitions, 739 flow. Second operand has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:55,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:55,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:55,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:56,441 INFO L124 PetriNetUnfolderBase]: 1543/4299 cut-off events. [2025-01-10 01:15:56,442 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:56,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7209 conditions, 4299 events. 1543/4299 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33359 event pairs, 1240 based on Foata normal form. 1/3510 useless extension candidates. Maximal degree in co-relation 7181. Up to 2881 conditions per place. [2025-01-10 01:15:56,469 INFO L140 encePairwiseOnDemand]: 509/513 looper letters, 185 selfloop transitions, 3 changer transitions 0/357 dead transitions. [2025-01-10 01:15:56,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 357 transitions, 1109 flow [2025-01-10 01:15:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 873 transitions. [2025-01-10 01:15:56,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42543859649122806 [2025-01-10 01:15:56,473 INFO L175 Difference]: Start difference. First operand has 335 places, 360 transitions, 739 flow. Second operand 4 states and 873 transitions. [2025-01-10 01:15:56,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 357 transitions, 1109 flow [2025-01-10 01:15:56,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 357 transitions, 1097 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:15:56,479 INFO L231 Difference]: Finished difference. Result has 330 places, 357 transitions, 727 flow [2025-01-10 01:15:56,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=727, PETRI_PLACES=330, PETRI_TRANSITIONS=357} [2025-01-10 01:15:56,481 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -29 predicate places. [2025-01-10 01:15:56,481 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 357 transitions, 727 flow [2025-01-10 01:15:56,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:56,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:56,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:56,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:15:56,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:56,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -712839792, now seen corresponding path program 1 times [2025-01-10 01:15:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959602839] [2025-01-10 01:15:56,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:56,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:15:56,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:15:56,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:56,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:56,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:56,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959602839] [2025-01-10 01:15:56,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959602839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:56,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:56,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202844136] [2025-01-10 01:15:56,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:56,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:56,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:56,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:56,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:56,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 357 transitions, 727 flow. Second operand has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:56,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:56,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:56,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:57,182 INFO L124 PetriNetUnfolderBase]: 1543/4296 cut-off events. [2025-01-10 01:15:57,183 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:15:57,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7202 conditions, 4296 events. 1543/4296 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33318 event pairs, 1240 based on Foata normal form. 1/3508 useless extension candidates. Maximal degree in co-relation 7140. Up to 2881 conditions per place. [2025-01-10 01:15:57,206 INFO L140 encePairwiseOnDemand]: 509/513 looper letters, 184 selfloop transitions, 3 changer transitions 0/354 dead transitions. [2025-01-10 01:15:57,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 354 transitions, 1095 flow [2025-01-10 01:15:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 872 transitions. [2025-01-10 01:15:57,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4249512670565302 [2025-01-10 01:15:57,210 INFO L175 Difference]: Start difference. First operand has 330 places, 357 transitions, 727 flow. Second operand 4 states and 872 transitions. [2025-01-10 01:15:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 354 transitions, 1095 flow [2025-01-10 01:15:57,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 354 transitions, 1089 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:57,219 INFO L231 Difference]: Finished difference. Result has 327 places, 354 transitions, 721 flow [2025-01-10 01:15:57,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=721, PETRI_PLACES=327, PETRI_TRANSITIONS=354} [2025-01-10 01:15:57,221 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -32 predicate places. [2025-01-10 01:15:57,221 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 354 transitions, 721 flow [2025-01-10 01:15:57,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:57,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:57,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:57,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:15:57,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:57,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2142053447, now seen corresponding path program 1 times [2025-01-10 01:15:57,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:57,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607605227] [2025-01-10 01:15:57,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:57,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:57,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:15:57,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:15:57,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:57,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:57,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:57,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607605227] [2025-01-10 01:15:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607605227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:57,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453731357] [2025-01-10 01:15:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:57,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:57,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:57,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:57,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:57,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:57,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 354 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:57,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:57,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:57,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:57,897 INFO L124 PetriNetUnfolderBase]: 1543/4299 cut-off events. [2025-01-10 01:15:57,897 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:15:57,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7208 conditions, 4299 events. 1543/4299 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33359 event pairs, 1240 based on Foata normal form. 0/3510 useless extension candidates. Maximal degree in co-relation 7146. Up to 2893 conditions per place. [2025-01-10 01:15:57,917 INFO L140 encePairwiseOnDemand]: 510/513 looper letters, 188 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-01-10 01:15:57,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 357 transitions, 1107 flow [2025-01-10 01:15:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2025-01-10 01:15:57,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45743989603638724 [2025-01-10 01:15:57,921 INFO L175 Difference]: Start difference. First operand has 327 places, 354 transitions, 721 flow. Second operand 3 states and 704 transitions. [2025-01-10 01:15:57,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 357 transitions, 1107 flow [2025-01-10 01:15:57,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 357 transitions, 1101 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:57,930 INFO L231 Difference]: Finished difference. Result has 327 places, 355 transitions, 727 flow [2025-01-10 01:15:57,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=327, PETRI_TRANSITIONS=355} [2025-01-10 01:15:57,931 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -32 predicate places. [2025-01-10 01:15:57,932 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 355 transitions, 727 flow [2025-01-10 01:15:57,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:57,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:57,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:57,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:15:57,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:57,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash -57276516, now seen corresponding path program 1 times [2025-01-10 01:15:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423988611] [2025-01-10 01:15:57,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:57,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:15:57,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:15:57,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:57,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:58,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423988611] [2025-01-10 01:15:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423988611] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:15:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879838564] [2025-01-10 01:15:58,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:58,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:58,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:15:58,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:15:58,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:15:58,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:15:58,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:58,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:15:58,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:15:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:58,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:15:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879838564] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:15:58,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:15:58,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:15:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577088591] [2025-01-10 01:15:58,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:15:58,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:15:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:58,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:15:58,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:15:58,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:58,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 355 transitions, 727 flow. Second operand has 7 states, 7 states have (on average 173.57142857142858) internal successors, (1215), 7 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:58,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:58,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:58,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:59,158 INFO L124 PetriNetUnfolderBase]: 1543/4302 cut-off events. [2025-01-10 01:15:59,158 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:15:59,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7218 conditions, 4302 events. 1543/4302 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33319 event pairs, 1240 based on Foata normal form. 1/3514 useless extension candidates. Maximal degree in co-relation 7194. Up to 2891 conditions per place. [2025-01-10 01:15:59,177 INFO L140 encePairwiseOnDemand]: 509/513 looper letters, 188 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2025-01-10 01:15:59,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 360 transitions, 1125 flow [2025-01-10 01:15:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:15:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:15:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1049 transitions. [2025-01-10 01:15:59,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40896686159844053 [2025-01-10 01:15:59,182 INFO L175 Difference]: Start difference. First operand has 327 places, 355 transitions, 727 flow. Second operand 5 states and 1049 transitions. [2025-01-10 01:15:59,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 360 transitions, 1125 flow [2025-01-10 01:15:59,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 360 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:59,188 INFO L231 Difference]: Finished difference. Result has 332 places, 357 transitions, 751 flow [2025-01-10 01:15:59,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=332, PETRI_TRANSITIONS=357} [2025-01-10 01:15:59,189 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -27 predicate places. [2025-01-10 01:15:59,189 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 357 transitions, 751 flow [2025-01-10 01:15:59,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 173.57142857142858) internal successors, (1215), 7 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:59,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:59,190 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:59,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:15:59,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:15:59,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:15:59,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:59,392 INFO L85 PathProgramCache]: Analyzing trace with hash -570103769, now seen corresponding path program 2 times [2025-01-10 01:15:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:59,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046476200] [2025-01-10 01:15:59,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:15:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:59,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:15:59,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 20 statements. [2025-01-10 01:15:59,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:15:59,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:15:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046476200] [2025-01-10 01:15:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046476200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601613368] [2025-01-10 01:15:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:59,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:59,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:59,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:15:59,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 357 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:59,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:59,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:15:59,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:00,103 INFO L124 PetriNetUnfolderBase]: 1543/4299 cut-off events. [2025-01-10 01:16:00,103 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 01:16:00,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7225 conditions, 4299 events. 1543/4299 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33341 event pairs, 1240 based on Foata normal form. 1/3511 useless extension candidates. Maximal degree in co-relation 7177. Up to 2888 conditions per place. [2025-01-10 01:16:00,123 INFO L140 encePairwiseOnDemand]: 510/513 looper letters, 187 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2025-01-10 01:16:00,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 354 transitions, 1123 flow [2025-01-10 01:16:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-01-10 01:16:00,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4548408057179987 [2025-01-10 01:16:00,127 INFO L175 Difference]: Start difference. First operand has 332 places, 357 transitions, 751 flow. Second operand 3 states and 700 transitions. [2025-01-10 01:16:00,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 354 transitions, 1123 flow [2025-01-10 01:16:00,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 354 transitions, 1117 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:00,135 INFO L231 Difference]: Finished difference. Result has 330 places, 354 transitions, 743 flow [2025-01-10 01:16:00,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=330, PETRI_TRANSITIONS=354} [2025-01-10 01:16:00,138 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -29 predicate places. [2025-01-10 01:16:00,138 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 354 transitions, 743 flow [2025-01-10 01:16:00,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:00,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:00,139 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:00,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:16:00,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:00,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash 113832492, now seen corresponding path program 1 times [2025-01-10 01:16:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086553309] [2025-01-10 01:16:00,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:00,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:16:00,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:16:00,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:00,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:16:00,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:00,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086553309] [2025-01-10 01:16:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086553309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:00,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851741542] [2025-01-10 01:16:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:00,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:00,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:00,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:00,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:00,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 513 [2025-01-10 01:16:00,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 354 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:00,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:00,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 513 [2025-01-10 01:16:00,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:01,098 INFO L124 PetriNetUnfolderBase]: 1835/4968 cut-off events. [2025-01-10 01:16:01,098 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 01:16:01,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8438 conditions, 4968 events. 1835/4968 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 39303 event pairs, 1240 based on Foata normal form. 0/4111 useless extension candidates. Maximal degree in co-relation 8392. Up to 2901 conditions per place. [2025-01-10 01:16:01,122 INFO L140 encePairwiseOnDemand]: 509/513 looper letters, 335 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2025-01-10 01:16:01,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 498 transitions, 1705 flow [2025-01-10 01:16:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2025-01-10 01:16:01,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-01-10 01:16:01,125 INFO L175 Difference]: Start difference. First operand has 330 places, 354 transitions, 743 flow. Second operand 3 states and 837 transitions. [2025-01-10 01:16:01,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 498 transitions, 1705 flow [2025-01-10 01:16:01,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 498 transitions, 1701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:01,134 INFO L231 Difference]: Finished difference. Result has 328 places, 352 transitions, 739 flow [2025-01-10 01:16:01,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=328, PETRI_TRANSITIONS=352} [2025-01-10 01:16:01,135 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -31 predicate places. [2025-01-10 01:16:01,135 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 352 transitions, 739 flow [2025-01-10 01:16:01,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:01,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:01,136 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:01,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:16:01,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash 113832493, now seen corresponding path program 1 times [2025-01-10 01:16:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:01,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033000777] [2025-01-10 01:16:01,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:01,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:16:01,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:16:01,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:01,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:16:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033000777] [2025-01-10 01:16:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033000777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:01,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:01,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836579281] [2025-01-10 01:16:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:01,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:01,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:01,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:16:01,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 352 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:01,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:01,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:16:01,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:01,912 INFO L124 PetriNetUnfolderBase]: 1546/4329 cut-off events. [2025-01-10 01:16:01,913 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-01-10 01:16:01,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7395 conditions, 4329 events. 1546/4329 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33242 event pairs, 1240 based on Foata normal form. 0/3539 useless extension candidates. Maximal degree in co-relation 7348. Up to 2902 conditions per place. [2025-01-10 01:16:01,934 INFO L140 encePairwiseOnDemand]: 510/513 looper letters, 202 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-01-10 01:16:01,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 367 transitions, 1177 flow [2025-01-10 01:16:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-01-10 01:16:01,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4645873944119558 [2025-01-10 01:16:01,937 INFO L175 Difference]: Start difference. First operand has 328 places, 352 transitions, 739 flow. Second operand 3 states and 715 transitions. [2025-01-10 01:16:01,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 367 transitions, 1177 flow [2025-01-10 01:16:01,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 367 transitions, 1173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:01,944 INFO L231 Difference]: Finished difference. Result has 329 places, 353 transitions, 747 flow [2025-01-10 01:16:01,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=329, PETRI_TRANSITIONS=353} [2025-01-10 01:16:01,945 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -30 predicate places. [2025-01-10 01:16:01,945 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 353 transitions, 747 flow [2025-01-10 01:16:01,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:01,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:01,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:01,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:16:01,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:01,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1786734156, now seen corresponding path program 1 times [2025-01-10 01:16:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945397738] [2025-01-10 01:16:01,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:01,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:16:01,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:16:01,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:01,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:16:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945397738] [2025-01-10 01:16:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945397738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112310804] [2025-01-10 01:16:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:02,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:02,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:02,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:02,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:16:02,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 353 transitions, 747 flow. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:02,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:02,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:16:02,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:02,839 INFO L124 PetriNetUnfolderBase]: 1546/4323 cut-off events. [2025-01-10 01:16:02,839 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 01:16:02,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7266 conditions, 4323 events. 1546/4323 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33288 event pairs, 1240 based on Foata normal form. 2/3536 useless extension candidates. Maximal degree in co-relation 7219. Up to 2889 conditions per place. [2025-01-10 01:16:02,863 INFO L140 encePairwiseOnDemand]: 508/513 looper letters, 184 selfloop transitions, 5 changer transitions 0/350 dead transitions. [2025-01-10 01:16:02,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 350 transitions, 1119 flow [2025-01-10 01:16:02,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 870 transitions. [2025-01-10 01:16:02,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4239766081871345 [2025-01-10 01:16:02,866 INFO L175 Difference]: Start difference. First operand has 329 places, 353 transitions, 747 flow. Second operand 4 states and 870 transitions. [2025-01-10 01:16:02,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 350 transitions, 1119 flow [2025-01-10 01:16:02,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 350 transitions, 1117 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:02,874 INFO L231 Difference]: Finished difference. Result has 328 places, 350 transitions, 749 flow [2025-01-10 01:16:02,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=749, PETRI_PLACES=328, PETRI_TRANSITIONS=350} [2025-01-10 01:16:02,876 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -31 predicate places. [2025-01-10 01:16:02,876 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 350 transitions, 749 flow [2025-01-10 01:16:02,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:02,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:02,877 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:02,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:16:02,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:02,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash -152648568, now seen corresponding path program 1 times [2025-01-10 01:16:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760761295] [2025-01-10 01:16:02,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:02,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:16:02,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:16:02,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:02,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:16:03,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760761295] [2025-01-10 01:16:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760761295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:03,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:03,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:03,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622754469] [2025-01-10 01:16:03,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:03,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:03,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:03,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:03,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:16:03,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 350 transitions, 749 flow. Second operand has 5 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:03,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:03,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:16:03,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:04,101 INFO L124 PetriNetUnfolderBase]: 1546/4321 cut-off events. [2025-01-10 01:16:04,102 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:16:04,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7269 conditions, 4321 events. 1546/4321 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33262 event pairs, 1240 based on Foata normal form. 0/3534 useless extension candidates. Maximal degree in co-relation 7222. Up to 2888 conditions per place. [2025-01-10 01:16:04,122 INFO L140 encePairwiseOnDemand]: 507/513 looper letters, 182 selfloop transitions, 6 changer transitions 0/349 dead transitions. [2025-01-10 01:16:04,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 349 transitions, 1123 flow [2025-01-10 01:16:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:16:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:16:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1040 transitions. [2025-01-10 01:16:04,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40545808966861596 [2025-01-10 01:16:04,125 INFO L175 Difference]: Start difference. First operand has 328 places, 350 transitions, 749 flow. Second operand 5 states and 1040 transitions. [2025-01-10 01:16:04,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 349 transitions, 1123 flow [2025-01-10 01:16:04,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 349 transitions, 1113 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:16:04,131 INFO L231 Difference]: Finished difference. Result has 328 places, 349 transitions, 749 flow [2025-01-10 01:16:04,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=749, PETRI_PLACES=328, PETRI_TRANSITIONS=349} [2025-01-10 01:16:04,132 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -31 predicate places. [2025-01-10 01:16:04,132 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 349 transitions, 749 flow [2025-01-10 01:16:04,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:04,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:04,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:04,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:16:04,133 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:04,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:04,134 INFO L85 PathProgramCache]: Analyzing trace with hash -152648569, now seen corresponding path program 1 times [2025-01-10 01:16:04,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:04,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177843016] [2025-01-10 01:16:04,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:04,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:16:04,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:16:04,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:04,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:16:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177843016] [2025-01-10 01:16:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177843016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:04,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:04,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432913360] [2025-01-10 01:16:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:04,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:04,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:04,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:04,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:16:04,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 349 transitions, 749 flow. Second operand has 5 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:04,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:04,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:16:04,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:05,377 INFO L124 PetriNetUnfolderBase]: 1536/4210 cut-off events. [2025-01-10 01:16:05,377 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 01:16:05,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7157 conditions, 4210 events. 1536/4210 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 32173 event pairs, 992 based on Foata normal form. 0/3465 useless extension candidates. Maximal degree in co-relation 7109. Up to 2342 conditions per place. [2025-01-10 01:16:05,400 INFO L140 encePairwiseOnDemand]: 505/513 looper letters, 325 selfloop transitions, 8 changer transitions 0/494 dead transitions. [2025-01-10 01:16:05,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 494 transitions, 1705 flow [2025-01-10 01:16:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:16:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:16:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-01-10 01:16:05,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4405458089668616 [2025-01-10 01:16:05,405 INFO L175 Difference]: Start difference. First operand has 328 places, 349 transitions, 749 flow. Second operand 6 states and 1356 transitions. [2025-01-10 01:16:05,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 494 transitions, 1705 flow [2025-01-10 01:16:05,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 494 transitions, 1693 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:16:05,412 INFO L231 Difference]: Finished difference. Result has 328 places, 348 transitions, 751 flow [2025-01-10 01:16:05,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=751, PETRI_PLACES=328, PETRI_TRANSITIONS=348} [2025-01-10 01:16:05,413 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -31 predicate places. [2025-01-10 01:16:05,413 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 348 transitions, 751 flow [2025-01-10 01:16:05,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:05,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:05,413 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:05,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:16:05,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:05,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash -666281994, now seen corresponding path program 1 times [2025-01-10 01:16:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:05,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471813971] [2025-01-10 01:16:05,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:05,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:05,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:16:05,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:16:05,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:05,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:16:05,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:05,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471813971] [2025-01-10 01:16:05,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471813971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:05,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:05,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051388361] [2025-01-10 01:16:05,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:05,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:05,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:05,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:05,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:05,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 513 [2025-01-10 01:16:05,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 348 transitions, 751 flow. Second operand has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:05,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:05,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 513 [2025-01-10 01:16:05,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:06,298 INFO L124 PetriNetUnfolderBase]: 1536/4206 cut-off events. [2025-01-10 01:16:06,298 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-01-10 01:16:06,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7282 conditions, 4206 events. 1536/4206 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 32098 event pairs, 992 based on Foata normal form. 2/3469 useless extension candidates. Maximal degree in co-relation 7233. Up to 2344 conditions per place. [2025-01-10 01:16:06,315 INFO L140 encePairwiseOnDemand]: 507/513 looper letters, 329 selfloop transitions, 5 changer transitions 0/492 dead transitions. [2025-01-10 01:16:06,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 492 transitions, 1707 flow [2025-01-10 01:16:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1004 transitions. [2025-01-10 01:16:06,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48927875243664715 [2025-01-10 01:16:06,319 INFO L175 Difference]: Start difference. First operand has 328 places, 348 transitions, 751 flow. Second operand 4 states and 1004 transitions. [2025-01-10 01:16:06,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 492 transitions, 1707 flow [2025-01-10 01:16:06,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 492 transitions, 1691 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:16:06,327 INFO L231 Difference]: Finished difference. Result has 324 places, 346 transitions, 741 flow [2025-01-10 01:16:06,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=741, PETRI_PLACES=324, PETRI_TRANSITIONS=346} [2025-01-10 01:16:06,328 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -35 predicate places. [2025-01-10 01:16:06,329 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 346 transitions, 741 flow [2025-01-10 01:16:06,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:06,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:06,330 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:06,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:16:06,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:06,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:06,330 INFO L85 PathProgramCache]: Analyzing trace with hash -666281993, now seen corresponding path program 1 times [2025-01-10 01:16:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:06,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284523658] [2025-01-10 01:16:06,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:06,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:06,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:16:06,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:16:06,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:06,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:16:06,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284523658] [2025-01-10 01:16:06,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284523658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:06,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:06,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:06,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155897728] [2025-01-10 01:16:06,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:06,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:16:06,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:06,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:16:06,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:16:06,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 513 [2025-01-10 01:16:06,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 346 transitions, 741 flow. Second operand has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:06,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:06,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 513 [2025-01-10 01:16:06,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:07,673 INFO L124 PetriNetUnfolderBase]: 1546/4311 cut-off events. [2025-01-10 01:16:07,674 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-01-10 01:16:07,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7380 conditions, 4311 events. 1546/4311 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33206 event pairs, 1240 based on Foata normal form. 4/3536 useless extension candidates. Maximal degree in co-relation 7332. Up to 2888 conditions per place. [2025-01-10 01:16:07,696 INFO L140 encePairwiseOnDemand]: 506/513 looper letters, 181 selfloop transitions, 6 changer transitions 0/344 dead transitions. [2025-01-10 01:16:07,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 344 transitions, 1111 flow [2025-01-10 01:16:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:16:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:16:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1030 transitions. [2025-01-10 01:16:07,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015594541910331 [2025-01-10 01:16:07,700 INFO L175 Difference]: Start difference. First operand has 324 places, 346 transitions, 741 flow. Second operand 5 states and 1030 transitions. [2025-01-10 01:16:07,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 344 transitions, 1111 flow [2025-01-10 01:16:07,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 344 transitions, 1101 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:16:07,707 INFO L231 Difference]: Finished difference. Result has 323 places, 344 transitions, 739 flow [2025-01-10 01:16:07,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=739, PETRI_PLACES=323, PETRI_TRANSITIONS=344} [2025-01-10 01:16:07,708 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -36 predicate places. [2025-01-10 01:16:07,708 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 344 transitions, 739 flow [2025-01-10 01:16:07,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:07,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:07,709 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:07,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:16:07,709 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:07,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1292970037, now seen corresponding path program 1 times [2025-01-10 01:16:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473920745] [2025-01-10 01:16:07,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:07,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 01:16:07,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 01:16:07,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:16:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473920745] [2025-01-10 01:16:07,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473920745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170448987] [2025-01-10 01:16:07,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:07,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:16:07,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:16:08,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 01:16:08,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 01:16:08,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:08,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:08,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:16:08,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:08,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:16:08,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170448987] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:08,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:08,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-01-10 01:16:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414566835] [2025-01-10 01:16:08,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:08,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:16:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:08,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:16:08,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:16:08,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 513 [2025-01-10 01:16:08,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 344 transitions, 739 flow. Second operand has 9 states, 9 states have (on average 175.44444444444446) internal successors, (1579), 9 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:08,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:08,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 513 [2025-01-10 01:16:08,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:09,370 INFO L124 PetriNetUnfolderBase]: 1549/4337 cut-off events. [2025-01-10 01:16:09,370 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 01:16:09,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7303 conditions, 4337 events. 1549/4337 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33136 event pairs, 1240 based on Foata normal form. 2/3560 useless extension candidates. Maximal degree in co-relation 7255. Up to 2877 conditions per place. [2025-01-10 01:16:09,396 INFO L140 encePairwiseOnDemand]: 507/513 looper letters, 206 selfloop transitions, 8 changer transitions 0/371 dead transitions. [2025-01-10 01:16:09,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 371 transitions, 1241 flow [2025-01-10 01:16:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:16:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:16:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1413 transitions. [2025-01-10 01:16:09,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39348370927318294 [2025-01-10 01:16:09,400 INFO L175 Difference]: Start difference. First operand has 323 places, 344 transitions, 739 flow. Second operand 7 states and 1413 transitions. [2025-01-10 01:16:09,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 371 transitions, 1241 flow [2025-01-10 01:16:09,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 371 transitions, 1213 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:16:09,407 INFO L231 Difference]: Finished difference. Result has 328 places, 346 transitions, 765 flow [2025-01-10 01:16:09,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=765, PETRI_PLACES=328, PETRI_TRANSITIONS=346} [2025-01-10 01:16:09,408 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -31 predicate places. [2025-01-10 01:16:09,408 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 346 transitions, 765 flow [2025-01-10 01:16:09,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 175.44444444444446) internal successors, (1579), 9 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:09,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:09,409 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:09,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:16:09,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:16:09,610 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:09,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1473888391, now seen corresponding path program 2 times [2025-01-10 01:16:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023317554] [2025-01-10 01:16:09,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:16:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:09,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-01-10 01:16:09,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 01:16:09,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:16:09,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-10 01:16:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023317554] [2025-01-10 01:16:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023317554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426756972] [2025-01-10 01:16:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:09,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:09,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:09,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:10,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 513 [2025-01-10 01:16:10,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 346 transitions, 765 flow. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:10,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:10,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 513 [2025-01-10 01:16:10,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:10,996 INFO L124 PetriNetUnfolderBase]: 1689/4635 cut-off events. [2025-01-10 01:16:10,996 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-01-10 01:16:11,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7876 conditions, 4635 events. 1689/4635 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 35661 event pairs, 862 based on Foata normal form. 0/3831 useless extension candidates. Maximal degree in co-relation 7823. Up to 1956 conditions per place. [2025-01-10 01:16:11,011 INFO L140 encePairwiseOnDemand]: 506/513 looper letters, 478 selfloop transitions, 5 changer transitions 0/638 dead transitions. [2025-01-10 01:16:11,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 638 transitions, 2315 flow [2025-01-10 01:16:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1155 transitions. [2025-01-10 01:16:11,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5628654970760234 [2025-01-10 01:16:11,015 INFO L175 Difference]: Start difference. First operand has 328 places, 346 transitions, 765 flow. Second operand 4 states and 1155 transitions. [2025-01-10 01:16:11,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 638 transitions, 2315 flow [2025-01-10 01:16:11,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 638 transitions, 2297 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 01:16:11,024 INFO L231 Difference]: Finished difference. Result has 327 places, 346 transitions, 769 flow [2025-01-10 01:16:11,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=769, PETRI_PLACES=327, PETRI_TRANSITIONS=346} [2025-01-10 01:16:11,025 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -32 predicate places. [2025-01-10 01:16:11,025 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 346 transitions, 769 flow [2025-01-10 01:16:11,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:11,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:11,025 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:11,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:16:11,026 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:11,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash -49393164, now seen corresponding path program 1 times [2025-01-10 01:16:11,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:11,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610322283] [2025-01-10 01:16:11,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:11,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 01:16:11,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 01:16:11,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:11,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:16:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610322283] [2025-01-10 01:16:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610322283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793357584] [2025-01-10 01:16:11,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:11,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:11,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:11,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:16:11,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:16:11,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 01:16:11,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 01:16:11,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:11,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:11,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:16:11,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:16:11,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:16:12,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793357584] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:12,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:12,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-10 01:16:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572820616] [2025-01-10 01:16:12,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:12,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:16:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:12,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:16:12,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:16:16,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-10 01:16:16,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 513 [2025-01-10 01:16:16,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 346 transitions, 769 flow. Second operand has 14 states, 14 states have (on average 172.92857142857142) internal successors, (2421), 14 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:16,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:16,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 513 [2025-01-10 01:16:16,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:18,211 INFO L124 PetriNetUnfolderBase]: 1550/4397 cut-off events. [2025-01-10 01:16:18,212 INFO L125 PetriNetUnfolderBase]: For 1020/1022 co-relation queries the response was YES. [2025-01-10 01:16:18,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8277 conditions, 4397 events. 1550/4397 cut-off events. For 1020/1022 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33602 event pairs, 1240 based on Foata normal form. 2/3731 useless extension candidates. Maximal degree in co-relation 8226. Up to 2884 conditions per place. [2025-01-10 01:16:18,227 INFO L140 encePairwiseOnDemand]: 502/513 looper letters, 216 selfloop transitions, 27 changer transitions 0/397 dead transitions. [2025-01-10 01:16:18,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 397 transitions, 1375 flow [2025-01-10 01:16:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:16:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 01:16:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3284 transitions. [2025-01-10 01:16:18,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35564219189950186 [2025-01-10 01:16:18,233 INFO L175 Difference]: Start difference. First operand has 327 places, 346 transitions, 769 flow. Second operand 18 states and 3284 transitions. [2025-01-10 01:16:18,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 397 transitions, 1375 flow [2025-01-10 01:16:18,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 397 transitions, 1370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:18,241 INFO L231 Difference]: Finished difference. Result has 352 places, 370 transitions, 947 flow [2025-01-10 01:16:18,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=947, PETRI_PLACES=352, PETRI_TRANSITIONS=370} [2025-01-10 01:16:18,242 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -7 predicate places. [2025-01-10 01:16:18,242 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 370 transitions, 947 flow [2025-01-10 01:16:18,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 172.92857142857142) internal successors, (2421), 14 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:18,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:18,243 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:18,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:16:18,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:18,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:18,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1191136146, now seen corresponding path program 1 times [2025-01-10 01:16:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:18,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241312167] [2025-01-10 01:16:18,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 01:16:18,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:16:18,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:18,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:16:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:18,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241312167] [2025-01-10 01:16:18,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241312167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:18,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:18,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:18,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090487468] [2025-01-10 01:16:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:18,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:18,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:18,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:18,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:18,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 513 [2025-01-10 01:16:18,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 370 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:18,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:18,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 513 [2025-01-10 01:16:18,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:19,632 INFO L124 PetriNetUnfolderBase]: 1542/4369 cut-off events. [2025-01-10 01:16:19,633 INFO L125 PetriNetUnfolderBase]: For 824/826 co-relation queries the response was YES. [2025-01-10 01:16:19,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8042 conditions, 4369 events. 1542/4369 cut-off events. For 824/826 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33554 event pairs, 1240 based on Foata normal form. 4/3713 useless extension candidates. Maximal degree in co-relation 7981. Up to 2922 conditions per place. [2025-01-10 01:16:19,664 INFO L140 encePairwiseOnDemand]: 510/513 looper letters, 201 selfloop transitions, 6 changer transitions 0/360 dead transitions. [2025-01-10 01:16:19,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 360 transitions, 1317 flow [2025-01-10 01:16:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2025-01-10 01:16:19,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44834307992202727 [2025-01-10 01:16:19,667 INFO L175 Difference]: Start difference. First operand has 352 places, 370 transitions, 947 flow. Second operand 3 states and 690 transitions. [2025-01-10 01:16:19,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 360 transitions, 1317 flow [2025-01-10 01:16:19,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 360 transitions, 1294 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:16:19,675 INFO L231 Difference]: Finished difference. Result has 345 places, 360 transitions, 892 flow [2025-01-10 01:16:19,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=513, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=345, PETRI_TRANSITIONS=360} [2025-01-10 01:16:19,676 INFO L279 CegarLoopForPetriNet]: 359 programPoint places, -14 predicate places. [2025-01-10 01:16:19,676 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 360 transitions, 892 flow [2025-01-10 01:16:19,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:19,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:19,676 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:19,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:16:19,677 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-01-10 01:16:19,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash 299343789, now seen corresponding path program 1 times [2025-01-10 01:16:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321676632] [2025-01-10 01:16:19,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:19,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 01:16:19,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:16:19,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:19,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:19,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:20,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 01:16:20,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:16:20,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:20,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:20,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:20,189 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:20,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (153 of 154 remaining) [2025-01-10 01:16:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 154 remaining) [2025-01-10 01:16:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (146 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (143 of 154 remaining) [2025-01-10 01:16:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (142 of 154 remaining) [2025-01-10 01:16:20,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (139 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (138 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (137 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (136 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 154 remaining) [2025-01-10 01:16:20,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONMEMORY_LEAK (127 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONMEMORY_LEAK (124 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr37ASSERT_VIOLATIONMEMORY_LEAK (119 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr40ASSERT_VIOLATIONMEMORY_LEAK (110 of 154 remaining) [2025-01-10 01:16:20,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 154 remaining) [2025-01-10 01:16:20,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 154 remaining) [2025-01-10 01:16:20,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONMEMORY_LEAK (107 of 154 remaining) [2025-01-10 01:16:20,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 154 remaining) [2025-01-10 01:16:20,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 154 remaining) [2025-01-10 01:16:20,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONMEMORY_LEAK (104 of 154 remaining) [2025-01-10 01:16:20,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 154 remaining) [2025-01-10 01:16:20,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONMEMORY_LEAK (95 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 154 remaining) [2025-01-10 01:16:20,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr47ASSERT_VIOLATIONMEMORY_LEAK (90 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr51ASSERT_VIOLATIONMEMORY_LEAK (87 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr50ASSERT_VIOLATIONMEMORY_LEAK (86 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 154 remaining) [2025-01-10 01:16:20,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 154 remaining) [2025-01-10 01:16:20,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 154 remaining) [2025-01-10 01:16:20,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr54ASSERT_VIOLATIONMEMORY_LEAK (81 of 154 remaining) [2025-01-10 01:16:20,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 154 remaining) [2025-01-10 01:16:20,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 154 remaining) [2025-01-10 01:16:20,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 154 remaining) [2025-01-10 01:16:20,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONMEMORY_LEAK (62 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONMEMORY_LEAK (59 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr37ASSERT_VIOLATIONMEMORY_LEAK (54 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr40ASSERT_VIOLATIONMEMORY_LEAK (45 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 154 remaining) [2025-01-10 01:16:20,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONMEMORY_LEAK (42 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONMEMORY_LEAK (39 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 154 remaining) [2025-01-10 01:16:20,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONMEMORY_LEAK (30 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr47ASSERT_VIOLATIONMEMORY_LEAK (25 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr51ASSERT_VIOLATIONMEMORY_LEAK (22 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr50ASSERT_VIOLATIONMEMORY_LEAK (21 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr54ASSERT_VIOLATIONMEMORY_LEAK (16 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 154 remaining) [2025-01-10 01:16:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 154 remaining) [2025-01-10 01:16:20,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 154 remaining) [2025-01-10 01:16:20,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 154 remaining) [2025-01-10 01:16:20,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 154 remaining) [2025-01-10 01:16:20,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 154 remaining) [2025-01-10 01:16:20,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 154 remaining) [2025-01-10 01:16:20,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:16:20,206 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:20,212 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:20,212 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 01:16:20,389 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:16:20,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 619 places, 888 transitions, 1792 flow [2025-01-10 01:16:20,611 INFO L124 PetriNetUnfolderBase]: 309/1009 cut-off events. [2025-01-10 01:16:20,611 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:16:20,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 1009 events. 309/1009 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5256 event pairs, 0 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 822. Up to 12 conditions per place. [2025-01-10 01:16:20,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 619 places, 888 transitions, 1792 flow [2025-01-10 01:16:20,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 619 places, 888 transitions, 1792 flow [2025-01-10 01:16:20,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:20,664 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;@45b6523b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:20,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 219 error locations. [2025-01-10 01:16:20,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:20,665 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-01-10 01:16:20,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:20,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:20,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 01:16:20,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 216 more)] === [2025-01-10 01:16:20,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash 129166, now seen corresponding path program 1 times [2025-01-10 01:16:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545260820] [2025-01-10 01:16:20,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:20,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 01:16:20,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 01:16:20,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:20,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545260820] [2025-01-10 01:16:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545260820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955367491] [2025-01-10 01:16:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:20,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:20,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:20,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:20,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 888 [2025-01-10 01:16:20,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 888 transitions, 1792 flow. Second operand has 3 states, 3 states have (on average 292.6666666666667) internal successors, (878), 3 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:20,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:20,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 888 [2025-01-10 01:16:20,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand