./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.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 f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:14:35,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:14:35,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:14:35,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:14:35,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:14:36,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:14:36,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:14:36,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:14:36,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:14:36,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:14:36,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:14:36,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:14:36,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:14:36,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:14:36,011 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:14:36,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:14:36,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:14:36,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:14:36,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:14:36,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:14:36,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:14:36,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:14:36,012 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:14:36,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:14:36,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:36,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:14:36,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:14:36,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:14:36,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:14:36,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:14:36,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:14:36,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:14:36,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:14:36,014 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 -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe [2025-02-06 13:14:36,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:14:36,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:14:36,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:14:36,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:14:36,287 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:14:36,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-02-06 13:14:37,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/667a3e16c/75546d00b3e64264835de6aecb137042/FLAGffae1e307 [2025-02-06 13:14:38,025 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:14:38,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-02-06 13:14:38,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/667a3e16c/75546d00b3e64264835de6aecb137042/FLAGffae1e307 [2025-02-06 13:14:38,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/667a3e16c/75546d00b3e64264835de6aecb137042 [2025-02-06 13:14:38,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:14:38,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:14:38,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:38,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:14:38,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:14:38,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:38" (1/1) ... [2025-02-06 13:14:38,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301e059d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:38, skipping insertion in model container [2025-02-06 13:14:38,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:38" (1/1) ... [2025-02-06 13:14:38,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:14:39,771 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,776 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,776 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,780 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,780 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,957 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:14:39,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:39,967 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:14:40,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-02-06 13:14:40,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-02-06 13:14:40,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-02-06 13:14:40,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-02-06 13:14:40,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-02-06 13:14:40,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-02-06 13:14:40,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-02-06 13:14:40,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-02-06 13:14:40,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-02-06 13:14:40,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-02-06 13:14:40,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-02-06 13:14:40,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-02-06 13:14:40,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-02-06 13:14:40,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-02-06 13:14:40,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-02-06 13:14:40,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-02-06 13:14:40,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-02-06 13:14:40,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-02-06 13:14:40,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-02-06 13:14:40,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-02-06 13:14:40,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-02-06 13:14:40,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-02-06 13:14:40,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-02-06 13:14:40,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-02-06 13:14:40,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-02-06 13:14:40,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-02-06 13:14:40,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-02-06 13:14:40,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-02-06 13:14:40,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-02-06 13:14:40,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-02-06 13:14:40,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-02-06 13:14:40,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-02-06 13:14:40,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-02-06 13:14:40,068 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-02-06 13:14:40,068 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-02-06 13:14:40,068 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-02-06 13:14:40,069 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-02-06 13:14:40,069 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-02-06 13:14:40,069 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-02-06 13:14:40,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-02-06 13:14:40,071 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-02-06 13:14:40,071 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-02-06 13:14:40,072 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-02-06 13:14:40,072 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-02-06 13:14:40,073 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-02-06 13:14:40,074 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-02-06 13:14:40,074 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-02-06 13:14:40,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-02-06 13:14:40,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-02-06 13:14:40,078 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-02-06 13:14:40,078 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-02-06 13:14:40,079 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-02-06 13:14:40,079 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-02-06 13:14:40,079 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-02-06 13:14:40,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-02-06 13:14:40,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-02-06 13:14:40,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-02-06 13:14:40,081 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-02-06 13:14:40,082 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-02-06 13:14:40,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-02-06 13:14:40,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-02-06 13:14:40,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-02-06 13:14:40,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-02-06 13:14:40,085 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-02-06 13:14:40,085 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-02-06 13:14:40,086 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-02-06 13:14:40,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-02-06 13:14:40,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-02-06 13:14:40,088 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-02-06 13:14:40,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-02-06 13:14:40,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-02-06 13:14:40,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-02-06 13:14:40,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-02-06 13:14:40,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-02-06 13:14:40,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-02-06 13:14:40,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-02-06 13:14:40,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-02-06 13:14:40,093 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-02-06 13:14:40,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-02-06 13:14:40,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-02-06 13:14:40,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-02-06 13:14:40,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-02-06 13:14:40,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-02-06 13:14:40,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-02-06 13:14:40,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-02-06 13:14:40,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-02-06 13:14:40,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-02-06 13:14:40,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-02-06 13:14:40,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-02-06 13:14:40,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-02-06 13:14:40,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-02-06 13:14:40,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-02-06 13:14:40,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-02-06 13:14:40,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-02-06 13:14:40,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-02-06 13:14:40,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-02-06 13:14:40,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-02-06 13:14:40,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-02-06 13:14:40,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-02-06 13:14:40,101 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-02-06 13:14:40,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:40,514 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:14:40,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40 WrapperNode [2025-02-06 13:14:40,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:40,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:40,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:14:40,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:14:40,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,661 INFO L138 Inliner]: procedures = 914, calls = 957, calls flagged for inlining = 822, calls inlined = 64, statements flattened = 649 [2025-02-06 13:14:40,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:40,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:14:40,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:14:40,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:14:40,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,711 INFO L175 MemorySlicer]: Split 65 memory accesses to 5 slices as follows [2, 2, 8, 44, 9]. 68 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 0, 4, 6, 5]. The 20 writes are split as follows [0, 1, 3, 14, 2]. [2025-02-06 13:14:40,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:14:40,754 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:14:40,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:14:40,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:14:40,756 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (1/1) ... [2025-02-06 13:14:40,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:40,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:40,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:14:40,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:14:40,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 13:14:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-02-06 13:14:40,817 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 13:14:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 13:14:40,818 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:14:41,041 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:14:41,042 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:14:41,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-06 13:14:41,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-9: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-06 13:14:41,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-18: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-06 13:14:41,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 13:14:41,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-9: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 13:14:41,967 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 13:14:41,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-9: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 13:14:41,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-18: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 13:14:41,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-27: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 13:14:41,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-06 13:14:41,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 13:14:41,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc main_~#r~0#1.base, main_~#r~0#1.offset; [2025-02-06 13:14:41,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset); srcloc: null [2025-02-06 13:14:41,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-02-06 13:14:42,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-06 13:14:42,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019: havoc ~#xbo~0#1.base, ~#xbo~0#1.offset; [2025-02-06 13:14:42,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019-1: SUMMARY for call ULTIMATE.dealloc(~#xbo~0#1.base, ~#xbo~0#1.offset); srcloc: null [2025-02-06 13:14:42,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 13:14:42,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 13:14:42,141 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:14:42,141 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:14:42,575 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:14:42,575 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:14:42,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:42 BoogieIcfgContainer [2025-02-06 13:14:42,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:14:42,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:14:42,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:14:42,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:14:42,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:14:38" (1/3) ... [2025-02-06 13:14:42,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6826e265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:42, skipping insertion in model container [2025-02-06 13:14:42,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:40" (2/3) ... [2025-02-06 13:14:42,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6826e265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:42, skipping insertion in model container [2025-02-06 13:14:42,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:42" (3/3) ... [2025-02-06 13:14:42,588 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-02-06 13:14:42,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:14:42,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 270 locations, 1 initial locations, 23 loop locations, and 104 error locations. [2025-02-06 13:14:42,606 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:14:42,736 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 13:14:42,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 335 transitions, 677 flow [2025-02-06 13:14:42,929 INFO L124 PetriNetUnfolderBase]: 116/574 cut-off events. [2025-02-06 13:14:42,931 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:14:42,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 574 events. 116/574 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2751 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 286. Up to 6 conditions per place. [2025-02-06 13:14:42,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 273 places, 335 transitions, 677 flow [2025-02-06 13:14:42,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 335 transitions, 677 flow [2025-02-06 13:14:42,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:14:42,986 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;@5ef1f649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:14:42,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-02-06 13:14:42,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:14:42,993 INFO L124 PetriNetUnfolderBase]: 6/18 cut-off events. [2025-02-06 13:14:42,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:14:42,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:42,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:14:42,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:42,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash 64530983, now seen corresponding path program 1 times [2025-02-06 13:14:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:43,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226006576] [2025-02-06 13:14:43,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:43,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:43,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:14:43,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:14:43,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:43,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226006576] [2025-02-06 13:14:43,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226006576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:43,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:43,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993682170] [2025-02-06 13:14:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:43,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 13:14:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:43,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 13:14:43,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 13:14:43,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 335 [2025-02-06 13:14:43,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 335 transitions, 677 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:43,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:43,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 335 [2025-02-06 13:14:43,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:44,476 INFO L124 PetriNetUnfolderBase]: 2768/7377 cut-off events. [2025-02-06 13:14:44,477 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-06 13:14:44,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12569 conditions, 7377 events. 2768/7377 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 58586 event pairs, 2199 based on Foata normal form. 1131/5711 useless extension candidates. Maximal degree in co-relation 12223. Up to 5187 conditions per place. [2025-02-06 13:14:44,530 INFO L140 encePairwiseOnDemand]: 275/335 looper letters, 145 selfloop transitions, 0 changer transitions 0/268 dead transitions. [2025-02-06 13:14:44,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 268 transitions, 833 flow [2025-02-06 13:14:44,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 13:14:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 13:14:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 451 transitions. [2025-02-06 13:14:44,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673134328358209 [2025-02-06 13:14:44,548 INFO L175 Difference]: Start difference. First operand has 273 places, 335 transitions, 677 flow. Second operand 2 states and 451 transitions. [2025-02-06 13:14:44,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 268 transitions, 833 flow [2025-02-06 13:14:44,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 268 transitions, 833 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:44,564 INFO L231 Difference]: Finished difference. Result has 259 places, 268 transitions, 543 flow [2025-02-06 13:14:44,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=543, PETRI_PLACES=259, PETRI_TRANSITIONS=268} [2025-02-06 13:14:44,572 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -14 predicate places. [2025-02-06 13:14:44,573 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 268 transitions, 543 flow [2025-02-06 13:14:44,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:44,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:44,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:14:44,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:14:44,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:44,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2000204059, now seen corresponding path program 1 times [2025-02-06 13:14:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063018225] [2025-02-06 13:14:44,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:44,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:14:44,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:14:44,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:44,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:44,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:44,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063018225] [2025-02-06 13:14:44,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063018225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:44,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:44,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617823352] [2025-02-06 13:14:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:44,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:44,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:44,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:44,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 335 [2025-02-06 13:14:44,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 268 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:44,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:44,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 335 [2025-02-06 13:14:44,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:45,789 INFO L124 PetriNetUnfolderBase]: 2768/7374 cut-off events. [2025-02-06 13:14:45,789 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:45,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12566 conditions, 7374 events. 2768/7374 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 58531 event pairs, 2199 based on Foata normal form. 1/4578 useless extension candidates. Maximal degree in co-relation 12562. Up to 5168 conditions per place. [2025-02-06 13:14:45,822 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 142 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-02-06 13:14:45,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 265 transitions, 825 flow [2025-02-06 13:14:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-02-06 13:14:45,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5114427860696518 [2025-02-06 13:14:45,828 INFO L175 Difference]: Start difference. First operand has 259 places, 268 transitions, 543 flow. Second operand 3 states and 514 transitions. [2025-02-06 13:14:45,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 265 transitions, 825 flow [2025-02-06 13:14:45,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 265 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:45,840 INFO L231 Difference]: Finished difference. Result has 258 places, 265 transitions, 541 flow [2025-02-06 13:14:45,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=258, PETRI_TRANSITIONS=265} [2025-02-06 13:14:45,841 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -15 predicate places. [2025-02-06 13:14:45,841 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 265 transitions, 541 flow [2025-02-06 13:14:45,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:45,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:45,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:45,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:14:45,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:45,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash -393789949, now seen corresponding path program 1 times [2025-02-06 13:14:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202974692] [2025-02-06 13:14:45,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:45,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:14:45,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:14:45,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:45,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:45,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:45,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202974692] [2025-02-06 13:14:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202974692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:45,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:45,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326151077] [2025-02-06 13:14:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:45,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:45,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:45,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:46,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 335 [2025-02-06 13:14:46,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 265 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:46,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:46,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 335 [2025-02-06 13:14:46,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:46,961 INFO L124 PetriNetUnfolderBase]: 2768/7372 cut-off events. [2025-02-06 13:14:46,962 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:46,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12567 conditions, 7372 events. 2768/7372 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 58567 event pairs, 2199 based on Foata normal form. 1/4578 useless extension candidates. Maximal degree in co-relation 12562. Up to 5168 conditions per place. [2025-02-06 13:14:47,000 INFO L140 encePairwiseOnDemand]: 331/335 looper letters, 142 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2025-02-06 13:14:47,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 263 transitions, 825 flow [2025-02-06 13:14:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-02-06 13:14:47,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064676616915423 [2025-02-06 13:14:47,004 INFO L175 Difference]: Start difference. First operand has 258 places, 265 transitions, 541 flow. Second operand 3 states and 509 transitions. [2025-02-06 13:14:47,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 263 transitions, 825 flow [2025-02-06 13:14:47,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 263 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:47,011 INFO L231 Difference]: Finished difference. Result has 256 places, 263 transitions, 537 flow [2025-02-06 13:14:47,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=256, PETRI_TRANSITIONS=263} [2025-02-06 13:14:47,013 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -17 predicate places. [2025-02-06 13:14:47,013 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 263 transitions, 537 flow [2025-02-06 13:14:47,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:47,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:47,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:47,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:14:47,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash -393789948, now seen corresponding path program 1 times [2025-02-06 13:14:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:47,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620853390] [2025-02-06 13:14:47,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:47,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:14:47,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:14:47,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:47,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620853390] [2025-02-06 13:14:47,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620853390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:47,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:47,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126541346] [2025-02-06 13:14:47,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:47,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:47,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:47,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:47,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 335 [2025-02-06 13:14:47,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 263 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:47,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:47,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 335 [2025-02-06 13:14:47,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:48,350 INFO L124 PetriNetUnfolderBase]: 2768/7370 cut-off events. [2025-02-06 13:14:48,351 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:48,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12565 conditions, 7370 events. 2768/7370 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 58634 event pairs, 2199 based on Foata normal form. 1/4577 useless extension candidates. Maximal degree in co-relation 12560. Up to 5168 conditions per place. [2025-02-06 13:14:48,376 INFO L140 encePairwiseOnDemand]: 331/335 looper letters, 142 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2025-02-06 13:14:48,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 261 transitions, 821 flow [2025-02-06 13:14:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-02-06 13:14:48,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064676616915423 [2025-02-06 13:14:48,380 INFO L175 Difference]: Start difference. First operand has 256 places, 263 transitions, 537 flow. Second operand 3 states and 509 transitions. [2025-02-06 13:14:48,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 261 transitions, 821 flow [2025-02-06 13:14:48,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 261 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:48,384 INFO L231 Difference]: Finished difference. Result has 254 places, 261 transitions, 533 flow [2025-02-06 13:14:48,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=254, PETRI_TRANSITIONS=261} [2025-02-06 13:14:48,386 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -19 predicate places. [2025-02-06 13:14:48,386 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 261 transitions, 533 flow [2025-02-06 13:14:48,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:48,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:48,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:48,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:14:48,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:48,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash -393786924, now seen corresponding path program 1 times [2025-02-06 13:14:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:48,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107138610] [2025-02-06 13:14:48,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:48,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:48,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:14:48,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:14:48,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:48,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107138610] [2025-02-06 13:14:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107138610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:48,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661538033] [2025-02-06 13:14:48,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:48,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:48,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:48,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:48,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 335 [2025-02-06 13:14:48,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 261 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:48,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:48,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 335 [2025-02-06 13:14:48,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:49,250 INFO L124 PetriNetUnfolderBase]: 2768/7367 cut-off events. [2025-02-06 13:14:49,251 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:49,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12561 conditions, 7367 events. 2768/7367 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 58618 event pairs, 2199 based on Foata normal form. 1/4574 useless extension candidates. Maximal degree in co-relation 12556. Up to 5168 conditions per place. [2025-02-06 13:14:49,277 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 141 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2025-02-06 13:14:49,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 258 transitions, 813 flow [2025-02-06 13:14:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2025-02-06 13:14:49,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104477611940299 [2025-02-06 13:14:49,281 INFO L175 Difference]: Start difference. First operand has 254 places, 261 transitions, 533 flow. Second operand 3 states and 513 transitions. [2025-02-06 13:14:49,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 258 transitions, 813 flow [2025-02-06 13:14:49,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 258 transitions, 809 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:49,286 INFO L231 Difference]: Finished difference. Result has 251 places, 258 transitions, 527 flow [2025-02-06 13:14:49,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=251, PETRI_TRANSITIONS=258} [2025-02-06 13:14:49,287 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -22 predicate places. [2025-02-06 13:14:49,289 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 258 transitions, 527 flow [2025-02-06 13:14:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:49,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:49,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:49,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:14:49,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:49,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash -474952395, now seen corresponding path program 1 times [2025-02-06 13:14:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:49,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683064205] [2025-02-06 13:14:49,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:49,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:14:49,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:14:49,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:49,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683064205] [2025-02-06 13:14:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683064205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:49,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:49,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634684885] [2025-02-06 13:14:49,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:49,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:49,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:49,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:49,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:49,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 335 [2025-02-06 13:14:49,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 258 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:49,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:49,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 335 [2025-02-06 13:14:49,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:50,264 INFO L124 PetriNetUnfolderBase]: 2768/7366 cut-off events. [2025-02-06 13:14:50,265 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-06 13:14:50,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12560 conditions, 7366 events. 2768/7366 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 58613 event pairs, 2121 based on Foata normal form. 0/4576 useless extension candidates. Maximal degree in co-relation 12555. Up to 5000 conditions per place. [2025-02-06 13:14:50,293 INFO L140 encePairwiseOnDemand]: 321/335 looper letters, 162 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2025-02-06 13:14:50,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 286 transitions, 927 flow [2025-02-06 13:14:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:14:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:14:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 776 transitions. [2025-02-06 13:14:50,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4632835820895522 [2025-02-06 13:14:50,299 INFO L175 Difference]: Start difference. First operand has 251 places, 258 transitions, 527 flow. Second operand 5 states and 776 transitions. [2025-02-06 13:14:50,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 286 transitions, 927 flow [2025-02-06 13:14:50,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 286 transitions, 923 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:50,308 INFO L231 Difference]: Finished difference. Result has 250 places, 258 transitions, 558 flow [2025-02-06 13:14:50,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=558, PETRI_PLACES=250, PETRI_TRANSITIONS=258} [2025-02-06 13:14:50,311 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -23 predicate places. [2025-02-06 13:14:50,311 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 258 transitions, 558 flow [2025-02-06 13:14:50,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:50,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:50,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:50,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:14:50,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash -474952394, now seen corresponding path program 1 times [2025-02-06 13:14:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:50,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752312757] [2025-02-06 13:14:50,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:50,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:50,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:14:50,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:14:50,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:50,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752312757] [2025-02-06 13:14:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752312757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069397292] [2025-02-06 13:14:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:50,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:50,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:50,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 335 [2025-02-06 13:14:50,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 258 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:50,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:50,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 335 [2025-02-06 13:14:50,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:51,399 INFO L124 PetriNetUnfolderBase]: 2768/7365 cut-off events. [2025-02-06 13:14:51,399 INFO L125 PetriNetUnfolderBase]: For 173/175 co-relation queries the response was YES. [2025-02-06 13:14:51,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12903 conditions, 7365 events. 2768/7365 cut-off events. For 173/175 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 58629 event pairs, 2196 based on Foata normal form. 0/4746 useless extension candidates. Maximal degree in co-relation 12897. Up to 5171 conditions per place. [2025-02-06 13:14:51,431 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 138 selfloop transitions, 4 changer transitions 0/257 dead transitions. [2025-02-06 13:14:51,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 257 transitions, 840 flow [2025-02-06 13:14:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2025-02-06 13:14:51,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46492537313432836 [2025-02-06 13:14:51,434 INFO L175 Difference]: Start difference. First operand has 250 places, 258 transitions, 558 flow. Second operand 4 states and 623 transitions. [2025-02-06 13:14:51,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 257 transitions, 840 flow [2025-02-06 13:14:51,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 257 transitions, 827 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:51,449 INFO L231 Difference]: Finished difference. Result has 249 places, 257 transitions, 551 flow [2025-02-06 13:14:51,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=551, PETRI_PLACES=249, PETRI_TRANSITIONS=257} [2025-02-06 13:14:51,452 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -24 predicate places. [2025-02-06 13:14:51,452 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 257 transitions, 551 flow [2025-02-06 13:14:51,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:51,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:51,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:51,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:14:51,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1162658009, now seen corresponding path program 1 times [2025-02-06 13:14:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:51,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933847245] [2025-02-06 13:14:51,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:51,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:14:51,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:14:51,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:51,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:51,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:51,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933847245] [2025-02-06 13:14:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933847245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:51,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094771925] [2025-02-06 13:14:51,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:51,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:51,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:51,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:51,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 335 [2025-02-06 13:14:51,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 257 transitions, 551 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:51,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:51,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 335 [2025-02-06 13:14:51,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:52,821 INFO L124 PetriNetUnfolderBase]: 2768/7364 cut-off events. [2025-02-06 13:14:52,822 INFO L125 PetriNetUnfolderBase]: For 89/91 co-relation queries the response was YES. [2025-02-06 13:14:52,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12815 conditions, 7364 events. 2768/7364 cut-off events. For 89/91 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 58643 event pairs, 2196 based on Foata normal form. 0/4746 useless extension candidates. Maximal degree in co-relation 12809. Up to 5171 conditions per place. [2025-02-06 13:14:52,854 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 137 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2025-02-06 13:14:52,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 256 transitions, 831 flow [2025-02-06 13:14:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2025-02-06 13:14:52,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46417910447761196 [2025-02-06 13:14:52,857 INFO L175 Difference]: Start difference. First operand has 249 places, 257 transitions, 551 flow. Second operand 4 states and 622 transitions. [2025-02-06 13:14:52,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 256 transitions, 831 flow [2025-02-06 13:14:52,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 256 transitions, 823 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:52,865 INFO L231 Difference]: Finished difference. Result has 248 places, 256 transitions, 549 flow [2025-02-06 13:14:52,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=248, PETRI_TRANSITIONS=256} [2025-02-06 13:14:52,867 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -25 predicate places. [2025-02-06 13:14:52,867 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 256 transitions, 549 flow [2025-02-06 13:14:52,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:52,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:52,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:52,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:14:52,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:52,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash -622782545, now seen corresponding path program 1 times [2025-02-06 13:14:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804374668] [2025-02-06 13:14:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:52,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:14:52,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:14:52,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:52,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:53,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804374668] [2025-02-06 13:14:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804374668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:53,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:53,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363578050] [2025-02-06 13:14:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:53,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:53,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:53,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:53,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 335 [2025-02-06 13:14:53,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 256 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:53,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:53,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 335 [2025-02-06 13:14:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:54,023 INFO L124 PetriNetUnfolderBase]: 2768/7363 cut-off events. [2025-02-06 13:14:54,023 INFO L125 PetriNetUnfolderBase]: For 88/90 co-relation queries the response was YES. [2025-02-06 13:14:54,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12813 conditions, 7363 events. 2768/7363 cut-off events. For 88/90 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 58678 event pairs, 2196 based on Foata normal form. 0/4746 useless extension candidates. Maximal degree in co-relation 12807. Up to 5171 conditions per place. [2025-02-06 13:14:54,045 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 136 selfloop transitions, 4 changer transitions 0/255 dead transitions. [2025-02-06 13:14:54,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 255 transitions, 827 flow [2025-02-06 13:14:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 621 transitions. [2025-02-06 13:14:54,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4634328358208955 [2025-02-06 13:14:54,048 INFO L175 Difference]: Start difference. First operand has 248 places, 256 transitions, 549 flow. Second operand 4 states and 621 transitions. [2025-02-06 13:14:54,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 255 transitions, 827 flow [2025-02-06 13:14:54,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 255 transitions, 819 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:54,054 INFO L231 Difference]: Finished difference. Result has 247 places, 255 transitions, 547 flow [2025-02-06 13:14:54,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=547, PETRI_PLACES=247, PETRI_TRANSITIONS=255} [2025-02-06 13:14:54,055 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -26 predicate places. [2025-02-06 13:14:54,055 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 255 transitions, 547 flow [2025-02-06 13:14:54,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:54,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:54,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:54,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:14:54,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:54,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:54,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1493511250, now seen corresponding path program 1 times [2025-02-06 13:14:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:54,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117043555] [2025-02-06 13:14:54,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:54,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:54,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:14:54,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:14:54,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:54,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117043555] [2025-02-06 13:14:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117043555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:54,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:54,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079308588] [2025-02-06 13:14:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:54,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:54,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:54,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:54,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 335 [2025-02-06 13:14:54,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 255 transitions, 547 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:54,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:54,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 335 [2025-02-06 13:14:54,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:55,173 INFO L124 PetriNetUnfolderBase]: 2768/7362 cut-off events. [2025-02-06 13:14:55,173 INFO L125 PetriNetUnfolderBase]: For 88/90 co-relation queries the response was YES. [2025-02-06 13:14:55,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12811 conditions, 7362 events. 2768/7362 cut-off events. For 88/90 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 58671 event pairs, 2196 based on Foata normal form. 0/4746 useless extension candidates. Maximal degree in co-relation 12805. Up to 5171 conditions per place. [2025-02-06 13:14:55,208 INFO L140 encePairwiseOnDemand]: 331/335 looper letters, 136 selfloop transitions, 3 changer transitions 0/254 dead transitions. [2025-02-06 13:14:55,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 254 transitions, 823 flow [2025-02-06 13:14:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2025-02-06 13:14:55,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4626865671641791 [2025-02-06 13:14:55,211 INFO L175 Difference]: Start difference. First operand has 247 places, 255 transitions, 547 flow. Second operand 4 states and 620 transitions. [2025-02-06 13:14:55,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 254 transitions, 823 flow [2025-02-06 13:14:55,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 254 transitions, 815 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:55,217 INFO L231 Difference]: Finished difference. Result has 246 places, 254 transitions, 543 flow [2025-02-06 13:14:55,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=543, PETRI_PLACES=246, PETRI_TRANSITIONS=254} [2025-02-06 13:14:55,218 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -27 predicate places. [2025-02-06 13:14:55,219 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 254 transitions, 543 flow [2025-02-06 13:14:55,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:55,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:55,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:14:55,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1625436006, now seen corresponding path program 1 times [2025-02-06 13:14:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583215445] [2025-02-06 13:14:55,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:55,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:55,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:14:55,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:14:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:55,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583215445] [2025-02-06 13:14:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583215445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:55,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090363527] [2025-02-06 13:14:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:55,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:55,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:55,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:55,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 335 [2025-02-06 13:14:55,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 254 transitions, 543 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:55,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:55,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 335 [2025-02-06 13:14:55,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:56,316 INFO L124 PetriNetUnfolderBase]: 2834/7705 cut-off events. [2025-02-06 13:14:56,317 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-02-06 13:14:56,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13281 conditions, 7705 events. 2834/7705 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 62687 event pairs, 2120 based on Foata normal form. 0/5004 useless extension candidates. Maximal degree in co-relation 13275. Up to 5298 conditions per place. [2025-02-06 13:14:56,351 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 143 selfloop transitions, 6 changer transitions 0/262 dead transitions. [2025-02-06 13:14:56,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 262 transitions, 857 flow [2025-02-06 13:14:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions. [2025-02-06 13:14:56,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4708955223880597 [2025-02-06 13:14:56,353 INFO L175 Difference]: Start difference. First operand has 246 places, 254 transitions, 543 flow. Second operand 4 states and 631 transitions. [2025-02-06 13:14:56,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 262 transitions, 857 flow [2025-02-06 13:14:56,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 262 transitions, 851 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:56,360 INFO L231 Difference]: Finished difference. Result has 248 places, 259 transitions, 579 flow [2025-02-06 13:14:56,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=579, PETRI_PLACES=248, PETRI_TRANSITIONS=259} [2025-02-06 13:14:56,361 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -25 predicate places. [2025-02-06 13:14:56,361 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 259 transitions, 579 flow [2025-02-06 13:14:56,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:56,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:56,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:56,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:14:56,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:56,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:56,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1625436007, now seen corresponding path program 1 times [2025-02-06 13:14:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085037713] [2025-02-06 13:14:56,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:56,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:56,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:14:56,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:14:56,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:56,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085037713] [2025-02-06 13:14:56,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085037713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:56,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:56,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603972610] [2025-02-06 13:14:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:56,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:56,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:56,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:56,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 335 [2025-02-06 13:14:56,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 259 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:56,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:56,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 335 [2025-02-06 13:14:56,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:57,317 INFO L124 PetriNetUnfolderBase]: 2840/7753 cut-off events. [2025-02-06 13:14:57,317 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-02-06 13:14:57,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13633 conditions, 7753 events. 2840/7753 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 63811 event pairs, 2013 based on Foata normal form. 0/5094 useless extension candidates. Maximal degree in co-relation 13625. Up to 4998 conditions per place. [2025-02-06 13:14:57,333 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 267 selfloop transitions, 6 changer transitions 0/384 dead transitions. [2025-02-06 13:14:57,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 384 transitions, 1402 flow [2025-02-06 13:14:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-02-06 13:14:57,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6199004975124378 [2025-02-06 13:14:57,335 INFO L175 Difference]: Start difference. First operand has 248 places, 259 transitions, 579 flow. Second operand 3 states and 623 transitions. [2025-02-06 13:14:57,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 384 transitions, 1402 flow [2025-02-06 13:14:57,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 384 transitions, 1402 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:14:57,342 INFO L231 Difference]: Finished difference. Result has 252 places, 263 transitions, 625 flow [2025-02-06 13:14:57,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=252, PETRI_TRANSITIONS=263} [2025-02-06 13:14:57,343 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -21 predicate places. [2025-02-06 13:14:57,343 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 263 transitions, 625 flow [2025-02-06 13:14:57,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:57,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:57,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:57,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:14:57,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:57,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1208531436, now seen corresponding path program 1 times [2025-02-06 13:14:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:57,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763113643] [2025-02-06 13:14:57,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:57,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:14:57,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:14:57,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:57,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:57,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:57,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763113643] [2025-02-06 13:14:57,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763113643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:57,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:57,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:57,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13075872] [2025-02-06 13:14:57,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:57,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:57,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:57,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:14:57,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 335 [2025-02-06 13:14:57,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 263 transitions, 625 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:57,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:57,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 335 [2025-02-06 13:14:57,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:58,480 INFO L124 PetriNetUnfolderBase]: 2822/7764 cut-off events. [2025-02-06 13:14:58,481 INFO L125 PetriNetUnfolderBase]: For 789/795 co-relation queries the response was YES. [2025-02-06 13:14:58,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13880 conditions, 7764 events. 2822/7764 cut-off events. For 789/795 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 63516 event pairs, 1971 based on Foata normal form. 3/5116 useless extension candidates. Maximal degree in co-relation 13870. Up to 4805 conditions per place. [2025-02-06 13:14:58,511 INFO L140 encePairwiseOnDemand]: 329/335 looper letters, 294 selfloop transitions, 7 changer transitions 0/414 dead transitions. [2025-02-06 13:14:58,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 414 transitions, 1559 flow [2025-02-06 13:14:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:14:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:14:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 888 transitions. [2025-02-06 13:14:58,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5301492537313433 [2025-02-06 13:14:58,514 INFO L175 Difference]: Start difference. First operand has 252 places, 263 transitions, 625 flow. Second operand 5 states and 888 transitions. [2025-02-06 13:14:58,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 414 transitions, 1559 flow [2025-02-06 13:14:58,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 414 transitions, 1545 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:58,525 INFO L231 Difference]: Finished difference. Result has 257 places, 266 transitions, 661 flow [2025-02-06 13:14:58,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=661, PETRI_PLACES=257, PETRI_TRANSITIONS=266} [2025-02-06 13:14:58,526 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -16 predicate places. [2025-02-06 13:14:58,527 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 266 transitions, 661 flow [2025-02-06 13:14:58,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:14:58,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:58,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:58,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:14:58,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:14:58,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1208531437, now seen corresponding path program 1 times [2025-02-06 13:14:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078614189] [2025-02-06 13:14:58,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:58,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:14:58,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:14:58,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:58,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:59,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078614189] [2025-02-06 13:14:59,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078614189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:59,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:59,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 13:14:59,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755986094] [2025-02-06 13:14:59,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:59,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:14:59,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:59,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:14:59,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:15:00,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 335 [2025-02-06 13:15:00,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 266 transitions, 661 flow. Second operand has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:00,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:00,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 335 [2025-02-06 13:15:00,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:02,784 INFO L124 PetriNetUnfolderBase]: 5536/14348 cut-off events. [2025-02-06 13:15:02,785 INFO L125 PetriNetUnfolderBase]: For 2466/2473 co-relation queries the response was YES. [2025-02-06 13:15:02,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26195 conditions, 14348 events. 5536/14348 cut-off events. For 2466/2473 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 128174 event pairs, 3453 based on Foata normal form. 179/9405 useless extension candidates. Maximal degree in co-relation 26183. Up to 4890 conditions per place. [2025-02-06 13:15:02,833 INFO L140 encePairwiseOnDemand]: 322/335 looper letters, 686 selfloop transitions, 35 changer transitions 1/834 dead transitions. [2025-02-06 13:15:02,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 834 transitions, 3355 flow [2025-02-06 13:15:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 13:15:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 13:15:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2725 transitions. [2025-02-06 13:15:02,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4784899034240562 [2025-02-06 13:15:02,840 INFO L175 Difference]: Start difference. First operand has 257 places, 266 transitions, 661 flow. Second operand 17 states and 2725 transitions. [2025-02-06 13:15:02,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 834 transitions, 3355 flow [2025-02-06 13:15:02,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 834 transitions, 3349 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 13:15:02,862 INFO L231 Difference]: Finished difference. Result has 280 places, 287 transitions, 873 flow [2025-02-06 13:15:02,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=873, PETRI_PLACES=280, PETRI_TRANSITIONS=287} [2025-02-06 13:15:02,863 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, 7 predicate places. [2025-02-06 13:15:02,863 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 287 transitions, 873 flow [2025-02-06 13:15:02,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:02,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:02,864 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:02,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:15:02,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-02-06 13:15:02,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1193266216, now seen corresponding path program 1 times [2025-02-06 13:15:02,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:02,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387840235] [2025-02-06 13:15:02,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:02,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:15:02,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:15:02,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:02,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:02,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:15:02,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:15:02,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:15:02,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:02,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:15:03,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:15:03,007 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:15:03,008 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (124 of 125 remaining) [2025-02-06 13:15:03,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (121 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK (118 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 125 remaining) [2025-02-06 13:15:03,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 125 remaining) [2025-02-06 13:15:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 125 remaining) [2025-02-06 13:15:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 125 remaining) [2025-02-06 13:15:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 125 remaining) [2025-02-06 13:15:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 125 remaining) [2025-02-06 13:15:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 125 remaining) [2025-02-06 13:15:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 125 remaining) [2025-02-06 13:15:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 125 remaining) [2025-02-06 13:15:03,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 125 remaining) [2025-02-06 13:15:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 125 remaining) [2025-02-06 13:15:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 125 remaining) [2025-02-06 13:15:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 125 remaining) [2025-02-06 13:15:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (91 of 125 remaining) [2025-02-06 13:15:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 125 remaining) [2025-02-06 13:15:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 125 remaining) [2025-02-06 13:15:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 125 remaining) [2025-02-06 13:15:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 125 remaining) [2025-02-06 13:15:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (84 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (81 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 125 remaining) [2025-02-06 13:15:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 125 remaining) [2025-02-06 13:15:03,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (64 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 125 remaining) [2025-02-06 13:15:03,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 125 remaining) [2025-02-06 13:15:03,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 125 remaining) [2025-02-06 13:15:03,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 125 remaining) [2025-02-06 13:15:03,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 125 remaining) [2025-02-06 13:15:03,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (47 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (46 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 125 remaining) [2025-02-06 13:15:03,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 125 remaining) [2025-02-06 13:15:03,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 125 remaining) [2025-02-06 13:15:03,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 125 remaining) [2025-02-06 13:15:03,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 125 remaining) [2025-02-06 13:15:03,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 125 remaining) [2025-02-06 13:15:03,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 125 remaining) [2025-02-06 13:15:03,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 125 remaining) [2025-02-06 13:15:03,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 125 remaining) [2025-02-06 13:15:03,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 125 remaining) [2025-02-06 13:15:03,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 125 remaining) [2025-02-06 13:15:03,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:15:03,022 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:03,025 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 13:15:03,025 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 13:15:03,114 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:15:03,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 317 places, 383 transitions, 782 flow [2025-02-06 13:15:03,208 INFO L124 PetriNetUnfolderBase]: 225/1100 cut-off events. [2025-02-06 13:15:03,208 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:15:03,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 1100 events. 225/1100 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6711 event pairs, 0 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 576. Up to 12 conditions per place. [2025-02-06 13:15:03,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 317 places, 383 transitions, 782 flow [2025-02-06 13:15:03,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 317 places, 383 transitions, 782 flow [2025-02-06 13:15:03,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:15:03,238 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;@5ef1f649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:15:03,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 145 error locations. [2025-02-06 13:15:03,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:15:03,241 INFO L124 PetriNetUnfolderBase]: 6/18 cut-off events. [2025-02-06 13:15:03,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:15:03,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:03,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 13:15:03,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 142 more)] === [2025-02-06 13:15:03,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash 76321255, now seen corresponding path program 1 times [2025-02-06 13:15:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369508869] [2025-02-06 13:15:03,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:03,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:15:03,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:15:03,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:03,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369508869] [2025-02-06 13:15:03,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369508869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:03,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:03,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:15:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217024413] [2025-02-06 13:15:03,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:03,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 13:15:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:03,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 13:15:03,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 13:15:03,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 383 [2025-02-06 13:15:03,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 383 transitions, 782 flow. Second operand has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:03,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:03,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 383 [2025-02-06 13:15:03,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:24,349 INFO L124 PetriNetUnfolderBase]: 149581/271754 cut-off events. [2025-02-06 13:15:24,350 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-02-06 13:15:24,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488679 conditions, 271754 events. 149581/271754 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 3862. Compared 2834127 event pairs, 124020 based on Foata normal form. 31065/195693 useless extension candidates. Maximal degree in co-relation 475781. Up to 216787 conditions per place. [2025-02-06 13:15:25,832 INFO L140 encePairwiseOnDemand]: 320/383 looper letters, 176 selfloop transitions, 0 changer transitions 0/313 dead transitions. [2025-02-06 13:15:25,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 313 transitions, 994 flow [2025-02-06 13:15:25,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 13:15:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 13:15:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 513 transitions. [2025-02-06 13:15:25,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697127937336814 [2025-02-06 13:15:25,834 INFO L175 Difference]: Start difference. First operand has 317 places, 383 transitions, 782 flow. Second operand 2 states and 513 transitions. [2025-02-06 13:15:25,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 313 transitions, 994 flow [2025-02-06 13:15:25,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 313 transitions, 994 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 13:15:25,844 INFO L231 Difference]: Finished difference. Result has 301 places, 313 transitions, 642 flow [2025-02-06 13:15:25,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=642, PETRI_PLACES=301, PETRI_TRANSITIONS=313} [2025-02-06 13:15:25,849 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -16 predicate places. [2025-02-06 13:15:25,849 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 313 transitions, 642 flow [2025-02-06 13:15:25,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:25,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:25,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:15:25,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:15:25,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 142 more)] === [2025-02-06 13:15:25,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1929264422, now seen corresponding path program 1 times [2025-02-06 13:15:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:25,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677247599] [2025-02-06 13:15:25,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:25,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:15:25,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:15:25,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:25,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:25,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677247599] [2025-02-06 13:15:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677247599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:25,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:15:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658507845] [2025-02-06 13:15:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:25,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:15:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:25,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:15:25,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:15:25,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 383 [2025-02-06 13:15:25,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 313 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:25,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:25,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 383 [2025-02-06 13:15:25,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand