./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.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/pthread-deagle/circular_buffer_ok.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 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:14:02,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:14:02,147 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:02,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:14:02,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:14:02,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:14:02,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:14:02,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:14:02,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:14:02,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:14:02,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:14:02,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:14:02,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:14:02,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:14:02,168 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:14:02,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:14:02,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:14:02,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:14:02,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:14:02,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:14:02,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:14:02,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:02,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:14:02,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:14:02,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:14:02,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:14:02,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:14:02,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:14:02,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:14:02,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:14:02,171 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 -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2025-02-06 13:14:02,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:14:02,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:14:02,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:14:02,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:14:02,405 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:14:02,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-02-06 13:14:03,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0881f6cda/4aa3638ee31f4063b84ff63680d75e7c/FLAG09d1b03e5 [2025-02-06 13:14:03,878 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:14:03,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-02-06 13:14:03,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0881f6cda/4aa3638ee31f4063b84ff63680d75e7c/FLAG09d1b03e5 [2025-02-06 13:14:03,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0881f6cda/4aa3638ee31f4063b84ff63680d75e7c [2025-02-06 13:14:03,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:14:03,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:14:03,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:03,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:14:03,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:14:03,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:03" (1/1) ... [2025-02-06 13:14:03,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67366e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:03, skipping insertion in model container [2025-02-06 13:14:03,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:14:03" (1/1) ... [2025-02-06 13:14:03,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:14:04,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:04,241 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:14:04,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:14:04,307 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:14:04,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:04 WrapperNode [2025-02-06 13:14:04,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:14:04,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:04,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:14:04,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:14:04,316 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:04" (1/1) ... [2025-02-06 13:14:04,329 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:04" (1/1) ... [2025-02-06 13:14:04,352 INFO L138 Inliner]: procedures = 168, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-02-06 13:14:04,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:14:04,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:14:04,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:14:04,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:14:04,364 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:04" (1/1) ... [2025-02-06 13:14:04,365 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:04" (1/1) ... [2025-02-06 13:14:04,367 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:04" (1/1) ... [2025-02-06 13:14:04,386 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-02-06 13:14:04,386 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:04" (1/1) ... [2025-02-06 13:14:04,386 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:04" (1/1) ... [2025-02-06 13:14:04,394 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:04" (1/1) ... [2025-02-06 13:14:04,398 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:04" (1/1) ... [2025-02-06 13:14:04,399 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:04" (1/1) ... [2025-02-06 13:14:04,400 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:04" (1/1) ... [2025-02-06 13:14:04,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:14:04,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:14:04,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:14:04,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:14:04,409 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:04" (1/1) ... [2025-02-06 13:14:04,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:14:04,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:04,440 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:04,444 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:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:14:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:14:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:14:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 13:14:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 13:14:04,464 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 13:14:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 13:14:04,464 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 13:14:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:14:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:14:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:14:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:14:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:14:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 13:14:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 13:14:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:14:04,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:14:04,467 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:04,591 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:14:04,593 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:14:04,860 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-02-06 13:14:04,861 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:14:04,861 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:14:05,000 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:14:05,000 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:14:05,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:05 BoogieIcfgContainer [2025-02-06 13:14:05,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:14:05,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:14:05,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:14:05,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:14:05,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:14:03" (1/3) ... [2025-02-06 13:14:05,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13383006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:05, skipping insertion in model container [2025-02-06 13:14:05,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:14:04" (2/3) ... [2025-02-06 13:14:05,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13383006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:14:05, skipping insertion in model container [2025-02-06 13:14:05,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:14:05" (3/3) ... [2025-02-06 13:14:05,008 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-02-06 13:14:05,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:14:05,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-02-06 13:14:05,022 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:14:05,099 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:14:05,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 146 flow [2025-02-06 13:14:05,161 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-02-06 13:14:05,162 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:14:05,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 12/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 185 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2025-02-06 13:14:05,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 66 transitions, 146 flow [2025-02-06 13:14:05,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 63 transitions, 138 flow [2025-02-06 13:14:05,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:14:05,192 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;@5f06d638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:14:05,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 13:14:05,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:14:05,204 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-06 13:14:05,204 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:14:05,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:05,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:05,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1483671667, now seen corresponding path program 1 times [2025-02-06 13:14:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001586961] [2025-02-06 13:14:05,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:05,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:14:05,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:14:05,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:05,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:05,485 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:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001586961] [2025-02-06 13:14:05,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001586961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:05,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:05,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:05,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251517913] [2025-02-06 13:14:05,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:05,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:05,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:05,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:05,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:05,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-02-06 13:14:05,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:05,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:05,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-02-06 13:14:05,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:05,713 INFO L124 PetriNetUnfolderBase]: 571/1094 cut-off events. [2025-02-06 13:14:05,714 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-06 13:14:05,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1094 events. 571/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5996 event pairs, 437 based on Foata normal form. 154/1136 useless extension candidates. Maximal degree in co-relation 1967. Up to 912 conditions per place. [2025-02-06 13:14:05,727 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 32 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-02-06 13:14:05,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 182 flow [2025-02-06 13:14:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-02-06 13:14:05,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-02-06 13:14:05,743 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 138 flow. Second operand 3 states and 104 transitions. [2025-02-06 13:14:05,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 182 flow [2025-02-06 13:14:05,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:05,751 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 110 flow [2025-02-06 13:14:05,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-02-06 13:14:05,756 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-02-06 13:14:05,756 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 110 flow [2025-02-06 13:14:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:05,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:05,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:05,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:14:05,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:05,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1483671666, now seen corresponding path program 1 times [2025-02-06 13:14:05,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:05,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49526037] [2025-02-06 13:14:05,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:05,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:14:05,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:14:05,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:05,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:06,011 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:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49526037] [2025-02-06 13:14:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49526037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783538942] [2025-02-06 13:14:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:06,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:06,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:06,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:06,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-02-06 13:14:06,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:06,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:06,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-02-06 13:14:06,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:06,251 INFO L124 PetriNetUnfolderBase]: 1024/1958 cut-off events. [2025-02-06 13:14:06,252 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:14:06,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 1958 events. 1024/1958 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11140 event pairs, 370 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 3577. Up to 901 conditions per place. [2025-02-06 13:14:06,263 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 59 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-02-06 13:14:06,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 289 flow [2025-02-06 13:14:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-02-06 13:14:06,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-02-06 13:14:06,268 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 110 flow. Second operand 3 states and 129 transitions. [2025-02-06 13:14:06,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 289 flow [2025-02-06 13:14:06,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:06,270 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 123 flow [2025-02-06 13:14:06,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2025-02-06 13:14:06,272 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-02-06 13:14:06,272 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 123 flow [2025-02-06 13:14:06,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:06,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:06,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:06,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:14:06,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:06,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -553749387, now seen corresponding path program 1 times [2025-02-06 13:14:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038016934] [2025-02-06 13:14:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:06,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:14:06,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:14:06,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:06,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:06,419 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:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038016934] [2025-02-06 13:14:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038016934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:06,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:14:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884978924] [2025-02-06 13:14:06,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:06,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:06,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:06,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:06,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:06,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-02-06 13:14:06,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:06,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:06,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-02-06 13:14:06,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:06,602 INFO L124 PetriNetUnfolderBase]: 1068/1989 cut-off events. [2025-02-06 13:14:06,602 INFO L125 PetriNetUnfolderBase]: For 51/53 co-relation queries the response was YES. [2025-02-06 13:14:06,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1989 events. 1068/1989 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11046 event pairs, 822 based on Foata normal form. 0/1808 useless extension candidates. Maximal degree in co-relation 3810. Up to 1678 conditions per place. [2025-02-06 13:14:06,614 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 34 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-02-06 13:14:06,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 187 flow [2025-02-06 13:14:06,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-02-06 13:14:06,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-02-06 13:14:06,617 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 123 flow. Second operand 3 states and 98 transitions. [2025-02-06 13:14:06,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 187 flow [2025-02-06 13:14:06,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:06,619 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 117 flow [2025-02-06 13:14:06,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-02-06 13:14:06,620 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-02-06 13:14:06,620 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 117 flow [2025-02-06 13:14:06,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:06,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:06,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:06,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:14:06,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:06,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:06,621 INFO L85 PathProgramCache]: Analyzing trace with hash -552794057, now seen corresponding path program 1 times [2025-02-06 13:14:06,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:06,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932123118] [2025-02-06 13:14:06,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:06,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:14:06,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:14:06,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:06,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:06,728 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:06,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:06,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932123118] [2025-02-06 13:14:06,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932123118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:06,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:06,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216570504] [2025-02-06 13:14:06,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:06,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:06,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:06,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:06,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-02-06 13:14:06,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:06,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:06,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-02-06 13:14:06,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:06,908 INFO L124 PetriNetUnfolderBase]: 739/1428 cut-off events. [2025-02-06 13:14:06,908 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-02-06 13:14:06,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1428 events. 739/1428 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7495 event pairs, 204 based on Foata normal form. 23/1363 useless extension candidates. Maximal degree in co-relation 2683. Up to 770 conditions per place. [2025-02-06 13:14:06,916 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-02-06 13:14:06,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 270 flow [2025-02-06 13:14:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-02-06 13:14:06,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2025-02-06 13:14:06,919 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 117 flow. Second operand 3 states and 124 transitions. [2025-02-06 13:14:06,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 270 flow [2025-02-06 13:14:06,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:06,921 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 124 flow [2025-02-06 13:14:06,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-02-06 13:14:06,922 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-02-06 13:14:06,922 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 124 flow [2025-02-06 13:14:06,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:06,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:06,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:06,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:14:06,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:06,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:06,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1267354103, now seen corresponding path program 1 times [2025-02-06 13:14:06,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:06,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216807317] [2025-02-06 13:14:06,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:06,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:06,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:14:06,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:14:06,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:06,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:06,957 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:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:06,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216807317] [2025-02-06 13:14:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216807317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:06,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52507157] [2025-02-06 13:14:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:06,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:06,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:06,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-02-06 13:14:06,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:06,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:06,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-02-06 13:14:06,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:07,186 INFO L124 PetriNetUnfolderBase]: 1181/2256 cut-off events. [2025-02-06 13:14:07,186 INFO L125 PetriNetUnfolderBase]: For 224/242 co-relation queries the response was YES. [2025-02-06 13:14:07,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 2256 events. 1181/2256 cut-off events. For 224/242 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13577 event pairs, 565 based on Foata normal form. 24/2104 useless extension candidates. Maximal degree in co-relation 4395. Up to 1235 conditions per place. [2025-02-06 13:14:07,197 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 56 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-02-06 13:14:07,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 298 flow [2025-02-06 13:14:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-02-06 13:14:07,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2025-02-06 13:14:07,202 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 124 flow. Second operand 3 states and 127 transitions. [2025-02-06 13:14:07,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 298 flow [2025-02-06 13:14:07,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:07,205 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 132 flow [2025-02-06 13:14:07,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-02-06 13:14:07,208 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-02-06 13:14:07,209 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 132 flow [2025-02-06 13:14:07,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:07,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:07,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:07,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:14:07,209 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:07,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1629164530, now seen corresponding path program 1 times [2025-02-06 13:14:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539284758] [2025-02-06 13:14:07,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:07,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:14:07,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:14:07,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:07,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:07,266 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:07,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:07,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539284758] [2025-02-06 13:14:07,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539284758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:07,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:07,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:14:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035895759] [2025-02-06 13:14:07,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:07,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:07,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:07,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:07,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:07,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-02-06 13:14:07,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:07,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:07,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-02-06 13:14:07,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:07,452 INFO L124 PetriNetUnfolderBase]: 1071/2133 cut-off events. [2025-02-06 13:14:07,452 INFO L125 PetriNetUnfolderBase]: For 202/218 co-relation queries the response was YES. [2025-02-06 13:14:07,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 2133 events. 1071/2133 cut-off events. For 202/218 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12166 event pairs, 502 based on Foata normal form. 47/2072 useless extension candidates. Maximal degree in co-relation 4219. Up to 903 conditions per place. [2025-02-06 13:14:07,461 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-02-06 13:14:07,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 302 flow [2025-02-06 13:14:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-02-06 13:14:07,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-02-06 13:14:07,462 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 132 flow. Second operand 3 states and 123 transitions. [2025-02-06 13:14:07,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 302 flow [2025-02-06 13:14:07,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:07,464 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 145 flow [2025-02-06 13:14:07,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-02-06 13:14:07,465 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2025-02-06 13:14:07,466 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 145 flow [2025-02-06 13:14:07,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:07,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:07,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:07,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:14:07,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:07,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash 190913853, now seen corresponding path program 1 times [2025-02-06 13:14:07,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:07,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310166935] [2025-02-06 13:14:07,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:07,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:07,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:14:07,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:14:07,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:07,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:07,565 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:07,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:07,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310166935] [2025-02-06 13:14:07,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310166935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:07,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:07,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 13:14:07,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353787288] [2025-02-06 13:14:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:07,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:14:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:07,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:14:07,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:14:07,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-02-06 13:14:07,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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:07,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:07,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-02-06 13:14:07,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:07,834 INFO L124 PetriNetUnfolderBase]: 1069/2029 cut-off events. [2025-02-06 13:14:07,835 INFO L125 PetriNetUnfolderBase]: For 304/317 co-relation queries the response was YES. [2025-02-06 13:14:07,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4226 conditions, 2029 events. 1069/2029 cut-off events. For 304/317 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11268 event pairs, 470 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 4213. Up to 1334 conditions per place. [2025-02-06 13:14:07,843 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 87 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2025-02-06 13:14:07,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 469 flow [2025-02-06 13:14:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:14:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:14:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2025-02-06 13:14:07,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346320346320347 [2025-02-06 13:14:07,845 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 145 flow. Second operand 7 states and 247 transitions. [2025-02-06 13:14:07,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 469 flow [2025-02-06 13:14:07,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:07,847 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 187 flow [2025-02-06 13:14:07,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-02-06 13:14:07,847 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-02-06 13:14:07,847 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 187 flow [2025-02-06 13:14:07,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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:07,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:07,848 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:07,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:14:07,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:07,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash 421030065, now seen corresponding path program 1 times [2025-02-06 13:14:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:07,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730728388] [2025-02-06 13:14:07,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:07,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:07,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:14:07,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:14:07,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:07,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:14:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730728388] [2025-02-06 13:14:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730728388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:07,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:07,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:07,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309256989] [2025-02-06 13:14:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:07,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:07,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:07,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:07,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-02-06 13:14:07,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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:07,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:07,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-02-06 13:14:07,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:08,134 INFO L124 PetriNetUnfolderBase]: 1714/3375 cut-off events. [2025-02-06 13:14:08,134 INFO L125 PetriNetUnfolderBase]: For 899/942 co-relation queries the response was YES. [2025-02-06 13:14:08,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 3375 events. 1714/3375 cut-off events. For 899/942 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 21396 event pairs, 797 based on Foata normal form. 75/3295 useless extension candidates. Maximal degree in co-relation 7357. Up to 1698 conditions per place. [2025-02-06 13:14:08,147 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 69 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-02-06 13:14:08,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 448 flow [2025-02-06 13:14:08,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-02-06 13:14:08,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2025-02-06 13:14:08,149 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 187 flow. Second operand 3 states and 127 transitions. [2025-02-06 13:14:08,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 448 flow [2025-02-06 13:14:08,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:08,156 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 193 flow [2025-02-06 13:14:08,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2025-02-06 13:14:08,157 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-02-06 13:14:08,157 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 193 flow [2025-02-06 13:14:08,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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:08,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:08,158 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:08,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:14:08,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:08,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1300819267, now seen corresponding path program 1 times [2025-02-06 13:14:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-02-06 13:14:08,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:08,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:14:08,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:14:08,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:08,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-02-06 13:14:08,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650441398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:08,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:08,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666727145] [2025-02-06 13:14:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:08,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:08,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:08,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:08,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-02-06 13:14:08,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:08,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:08,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-02-06 13:14:08,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:08,381 INFO L124 PetriNetUnfolderBase]: 1328/2547 cut-off events. [2025-02-06 13:14:08,382 INFO L125 PetriNetUnfolderBase]: For 740/759 co-relation queries the response was YES. [2025-02-06 13:14:08,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5785 conditions, 2547 events. 1328/2547 cut-off events. For 740/759 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14460 event pairs, 487 based on Foata normal form. 91/2571 useless extension candidates. Maximal degree in co-relation 5767. Up to 1421 conditions per place. [2025-02-06 13:14:08,393 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 54 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-02-06 13:14:08,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 356 flow [2025-02-06 13:14:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-02-06 13:14:08,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2025-02-06 13:14:08,394 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 193 flow. Second operand 3 states and 115 transitions. [2025-02-06 13:14:08,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 356 flow [2025-02-06 13:14:08,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 347 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:08,398 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 200 flow [2025-02-06 13:14:08,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-02-06 13:14:08,399 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-02-06 13:14:08,399 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 200 flow [2025-02-06 13:14:08,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:08,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:08,399 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:08,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:14:08,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:08,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash -830414537, now seen corresponding path program 1 times [2025-02-06 13:14:08,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:08,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-02-06 13:14:08,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:08,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:14:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:14:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:08,465 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:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:08,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-02-06 13:14:08,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532172894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:08,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:08,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:08,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393761341] [2025-02-06 13:14:08,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:08,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:08,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:08,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:08,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:08,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-02-06 13:14:08,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:08,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:08,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-02-06 13:14:08,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:08,603 INFO L124 PetriNetUnfolderBase]: 804/1816 cut-off events. [2025-02-06 13:14:08,604 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-02-06 13:14:08,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4151 conditions, 1816 events. 804/1816 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9932 event pairs, 255 based on Foata normal form. 92/1863 useless extension candidates. Maximal degree in co-relation 4133. Up to 821 conditions per place. [2025-02-06 13:14:08,610 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 48 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2025-02-06 13:14:08,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 352 flow [2025-02-06 13:14:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-02-06 13:14:08,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2025-02-06 13:14:08,611 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 200 flow. Second operand 3 states and 113 transitions. [2025-02-06 13:14:08,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 352 flow [2025-02-06 13:14:08,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:08,614 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2025-02-06 13:14:08,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-02-06 13:14:08,614 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-02-06 13:14:08,614 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2025-02-06 13:14:08,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:08,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:08,615 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, 1] [2025-02-06 13:14:08,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:14:08,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash -143705222, now seen corresponding path program 1 times [2025-02-06 13:14:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:08,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424449470] [2025-02-06 13:14:08,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:08,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:14:08,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:14:08,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:08,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:08,830 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:08,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424449470] [2025-02-06 13:14:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424449470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:08,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:08,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:08,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009756322] [2025-02-06 13:14:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:08,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:08,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:08,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:14:08,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-02-06 13:14:08,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:08,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:08,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-02-06 13:14:08,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:09,210 INFO L124 PetriNetUnfolderBase]: 1502/3217 cut-off events. [2025-02-06 13:14:09,210 INFO L125 PetriNetUnfolderBase]: For 1373/1373 co-relation queries the response was YES. [2025-02-06 13:14:09,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7730 conditions, 3217 events. 1502/3217 cut-off events. For 1373/1373 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 18001 event pairs, 492 based on Foata normal form. 0/3068 useless extension candidates. Maximal degree in co-relation 7712. Up to 959 conditions per place. [2025-02-06 13:14:09,227 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 107 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-02-06 13:14:09,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 675 flow [2025-02-06 13:14:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:14:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:14:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2025-02-06 13:14:09,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-02-06 13:14:09,229 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 5 states and 209 transitions. [2025-02-06 13:14:09,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 675 flow [2025-02-06 13:14:09,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 128 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:09,235 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 216 flow [2025-02-06 13:14:09,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2025-02-06 13:14:09,236 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-02-06 13:14:09,236 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 216 flow [2025-02-06 13:14:09,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:09,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:09,236 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, 1, 1] [2025-02-06 13:14:09,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:14:09,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:09,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:09,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1425936795, now seen corresponding path program 1 times [2025-02-06 13:14:09,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:09,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247563220] [2025-02-06 13:14:09,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:09,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:14:09,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:14:09,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:09,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:09,283 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:09,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247563220] [2025-02-06 13:14:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247563220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:14:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384811832] [2025-02-06 13:14:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:09,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:09,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:09,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:09,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-02-06 13:14:09,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:09,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:09,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-02-06 13:14:09,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:09,612 INFO L124 PetriNetUnfolderBase]: 2031/4470 cut-off events. [2025-02-06 13:14:09,613 INFO L125 PetriNetUnfolderBase]: For 1733/1735 co-relation queries the response was YES. [2025-02-06 13:14:09,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10412 conditions, 4470 events. 2031/4470 cut-off events. For 1733/1735 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 28636 event pairs, 823 based on Foata normal form. 106/4437 useless extension candidates. Maximal degree in co-relation 10391. Up to 2125 conditions per place. [2025-02-06 13:14:09,629 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 85 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-02-06 13:14:09,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 557 flow [2025-02-06 13:14:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-02-06 13:14:09,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6628787878787878 [2025-02-06 13:14:09,630 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 216 flow. Second operand 4 states and 175 transitions. [2025-02-06 13:14:09,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 557 flow [2025-02-06 13:14:09,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 108 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:09,633 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 233 flow [2025-02-06 13:14:09,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2025-02-06 13:14:09,634 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2025-02-06 13:14:09,634 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 233 flow [2025-02-06 13:14:09,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:09,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:09,635 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, 1, 1, 1, 1] [2025-02-06 13:14:09,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:14:09,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:09,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1757070241, now seen corresponding path program 1 times [2025-02-06 13:14:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44100248] [2025-02-06 13:14:09,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:09,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:14:09,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:14:09,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:09,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:14:09,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934930206] [2025-02-06 13:14:09,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:09,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:09,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:09,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:14:09,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:14:09,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:14:09,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:09,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:09,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 13:14:09,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:09,978 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:09,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:09,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44100248] [2025-02-06 13:14:09,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:14:09,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934930206] [2025-02-06 13:14:09,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934930206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:09,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:09,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:09,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163686601] [2025-02-06 13:14:09,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:09,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:09,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:09,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:09,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-02-06 13:14:09,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:09,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:09,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-02-06 13:14:09,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:10,274 INFO L124 PetriNetUnfolderBase]: 1515/3320 cut-off events. [2025-02-06 13:14:10,274 INFO L125 PetriNetUnfolderBase]: For 2183/2185 co-relation queries the response was YES. [2025-02-06 13:14:10,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8417 conditions, 3320 events. 1515/3320 cut-off events. For 2183/2185 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 19131 event pairs, 510 based on Foata normal form. 26/3257 useless extension candidates. Maximal degree in co-relation 8395. Up to 1576 conditions per place. [2025-02-06 13:14:10,285 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 71 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2025-02-06 13:14:10,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 93 transitions, 508 flow [2025-02-06 13:14:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:14:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:14:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-02-06 13:14:10,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5946969696969697 [2025-02-06 13:14:10,287 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 233 flow. Second operand 4 states and 157 transitions. [2025-02-06 13:14:10,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 93 transitions, 508 flow [2025-02-06 13:14:10,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 494 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 13:14:10,291 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 236 flow [2025-02-06 13:14:10,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2025-02-06 13:14:10,292 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2025-02-06 13:14:10,292 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 236 flow [2025-02-06 13:14:10,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:10,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:10,293 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, 1, 1, 1, 1, 1] [2025-02-06 13:14:10,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:14:10,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 13:14:10,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:10,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1268443680, now seen corresponding path program 1 times [2025-02-06 13:14:10,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:10,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930404339] [2025-02-06 13:14:10,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:14:10,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:14:10,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:10,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:11,098 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:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930404339] [2025-02-06 13:14:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930404339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:11,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 13:14:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651133264] [2025-02-06 13:14:11,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:11,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:14:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:14:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:14:11,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-02-06 13:14:11,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 236 flow. Second operand has 11 states, 11 states have (on average 24.818181818181817) internal successors, (273), 11 states have internal predecessors, (273), 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:11,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:11,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-02-06 13:14:11,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:12,005 INFO L124 PetriNetUnfolderBase]: 1758/3830 cut-off events. [2025-02-06 13:14:12,005 INFO L125 PetriNetUnfolderBase]: For 2130/2134 co-relation queries the response was YES. [2025-02-06 13:14:12,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9569 conditions, 3830 events. 1758/3830 cut-off events. For 2130/2134 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 22522 event pairs, 470 based on Foata normal form. 0/3734 useless extension candidates. Maximal degree in co-relation 9545. Up to 1068 conditions per place. [2025-02-06 13:14:12,017 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 146 selfloop transitions, 16 changer transitions 0/181 dead transitions. [2025-02-06 13:14:12,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 181 transitions, 1003 flow [2025-02-06 13:14:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:14:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:14:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 442 transitions. [2025-02-06 13:14:12,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-02-06 13:14:12,022 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 236 flow. Second operand 13 states and 442 transitions. [2025-02-06 13:14:12,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 181 transitions, 1003 flow [2025-02-06 13:14:12,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 181 transitions, 995 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:12,026 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 326 flow [2025-02-06 13:14:12,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=326, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2025-02-06 13:14:12,027 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-02-06 13:14:12,027 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 326 flow [2025-02-06 13:14:12,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.818181818181817) internal successors, (273), 11 states have internal predecessors, (273), 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:12,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:12,027 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:12,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:14:12,028 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:12,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1608177319, now seen corresponding path program 2 times [2025-02-06 13:14:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064584000] [2025-02-06 13:14:12,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:14:12,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:12,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 13:14:12,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 31 statements. [2025-02-06 13:14:12,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:14:12,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:14:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064584000] [2025-02-06 13:14:12,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064584000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:12,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:12,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:14:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689481476] [2025-02-06 13:14:12,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:12,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:14:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:12,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:14:12,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:14:12,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-02-06 13:14:12,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:12,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:12,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-02-06 13:14:12,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:12,298 INFO L124 PetriNetUnfolderBase]: 1744/3786 cut-off events. [2025-02-06 13:14:12,298 INFO L125 PetriNetUnfolderBase]: For 2667/2678 co-relation queries the response was YES. [2025-02-06 13:14:12,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9954 conditions, 3786 events. 1744/3786 cut-off events. For 2667/2678 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 22653 event pairs, 1360 based on Foata normal form. 13/3688 useless extension candidates. Maximal degree in co-relation 9926. Up to 2988 conditions per place. [2025-02-06 13:14:12,314 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 48 selfloop transitions, 1 changer transitions 3/69 dead transitions. [2025-02-06 13:14:12,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 69 transitions, 426 flow [2025-02-06 13:14:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-02-06 13:14:12,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 13:14:12,316 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 326 flow. Second operand 3 states and 99 transitions. [2025-02-06 13:14:12,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 69 transitions, 426 flow [2025-02-06 13:14:12,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 69 transitions, 413 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 13:14:12,321 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 301 flow [2025-02-06 13:14:12,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=86, PETRI_TRANSITIONS=66} [2025-02-06 13:14:12,322 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2025-02-06 13:14:12,322 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 301 flow [2025-02-06 13:14:12,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:12,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:12,322 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:12,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:14:12,323 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:12,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1689142016, now seen corresponding path program 1 times [2025-02-06 13:14:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847283186] [2025-02-06 13:14:12,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:12,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:14:12,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:14:12,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:12,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:12,625 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:12,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847283186] [2025-02-06 13:14:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847283186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:12,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:12,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:14:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502740808] [2025-02-06 13:14:12,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:12,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:14:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:12,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:14:12,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:14:12,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2025-02-06 13:14:12,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:12,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:12,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2025-02-06 13:14:12,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:13,131 INFO L124 PetriNetUnfolderBase]: 2258/4737 cut-off events. [2025-02-06 13:14:13,132 INFO L125 PetriNetUnfolderBase]: For 2893/2895 co-relation queries the response was YES. [2025-02-06 13:14:13,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12349 conditions, 4737 events. 2258/4737 cut-off events. For 2893/2895 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 27579 event pairs, 1218 based on Foata normal form. 42/4638 useless extension candidates. Maximal degree in co-relation 12321. Up to 1880 conditions per place. [2025-02-06 13:14:13,147 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 76 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2025-02-06 13:14:13,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 100 transitions, 608 flow [2025-02-06 13:14:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:14:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:14:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-02-06 13:14:13,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2025-02-06 13:14:13,149 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 301 flow. Second operand 5 states and 166 transitions. [2025-02-06 13:14:13,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 100 transitions, 608 flow [2025-02-06 13:14:13,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 100 transitions, 605 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:13,155 INFO L231 Difference]: Finished difference. Result has 87 places, 68 transitions, 341 flow [2025-02-06 13:14:13,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=341, PETRI_PLACES=87, PETRI_TRANSITIONS=68} [2025-02-06 13:14:13,156 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-02-06 13:14:13,156 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 68 transitions, 341 flow [2025-02-06 13:14:13,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:13,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:13,156 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:13,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:14:13,156 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:13,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2023382975, now seen corresponding path program 1 times [2025-02-06 13:14:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-02-06 13:14:13,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:13,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 13:14:13,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 13:14:13,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:13,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:13,220 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:13,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:13,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-02-06 13:14:13,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587885377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:13,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:13,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:14:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425241284] [2025-02-06 13:14:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:13,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:14:13,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:13,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:14:13,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:14:13,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-02-06 13:14:13,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 68 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:13,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:13,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-02-06 13:14:13,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:13,443 INFO L124 PetriNetUnfolderBase]: 1700/3619 cut-off events. [2025-02-06 13:14:13,443 INFO L125 PetriNetUnfolderBase]: For 2567/2569 co-relation queries the response was YES. [2025-02-06 13:14:13,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 3619 events. 1700/3619 cut-off events. For 2567/2569 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 19409 event pairs, 1354 based on Foata normal form. 36/3565 useless extension candidates. Maximal degree in co-relation 9638. Up to 2926 conditions per place. [2025-02-06 13:14:13,459 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 49 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-02-06 13:14:13,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 64 transitions, 416 flow [2025-02-06 13:14:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:14:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:14:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-02-06 13:14:13,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-02-06 13:14:13,460 INFO L175 Difference]: Start difference. First operand has 87 places, 68 transitions, 341 flow. Second operand 3 states and 96 transitions. [2025-02-06 13:14:13,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 64 transitions, 416 flow [2025-02-06 13:14:13,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 398 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:13,466 INFO L231 Difference]: Finished difference. Result has 85 places, 64 transitions, 300 flow [2025-02-06 13:14:13,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2025-02-06 13:14:13,467 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2025-02-06 13:14:13,467 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 300 flow [2025-02-06 13:14:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:13,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:13,467 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:13,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 13:14:13,467 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:13,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1237635381, now seen corresponding path program 1 times [2025-02-06 13:14:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:13,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609819172] [2025-02-06 13:14:13,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:13,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:14:13,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:14:13,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:13,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:13,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609819172] [2025-02-06 13:14:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609819172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:13,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:14:13,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:14:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280206811] [2025-02-06 13:14:13,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:13,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:13,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:13,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:14:13,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-02-06 13:14:13,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 64 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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:13,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:13,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-02-06 13:14:13,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:13,855 INFO L124 PetriNetUnfolderBase]: 1748/3653 cut-off events. [2025-02-06 13:14:13,856 INFO L125 PetriNetUnfolderBase]: For 2835/2835 co-relation queries the response was YES. [2025-02-06 13:14:13,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9792 conditions, 3653 events. 1748/3653 cut-off events. For 2835/2835 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 19188 event pairs, 871 based on Foata normal form. 0/3579 useless extension candidates. Maximal degree in co-relation 9763. Up to 2112 conditions per place. [2025-02-06 13:14:13,871 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 77 selfloop transitions, 12 changer transitions 5/106 dead transitions. [2025-02-06 13:14:13,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 106 transitions, 651 flow [2025-02-06 13:14:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:14:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:14:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2025-02-06 13:14:13,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025252525252525 [2025-02-06 13:14:13,873 INFO L175 Difference]: Start difference. First operand has 85 places, 64 transitions, 300 flow. Second operand 6 states and 199 transitions. [2025-02-06 13:14:13,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 106 transitions, 651 flow [2025-02-06 13:14:13,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 106 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:14:13,880 INFO L231 Difference]: Finished difference. Result has 87 places, 62 transitions, 331 flow [2025-02-06 13:14:13,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=87, PETRI_TRANSITIONS=62} [2025-02-06 13:14:13,881 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-02-06 13:14:13,881 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 62 transitions, 331 flow [2025-02-06 13:14:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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:13,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:13,881 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:13,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 13:14:13,881 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2098563028, now seen corresponding path program 1 times [2025-02-06 13:14:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:13,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934585380] [2025-02-06 13:14:13,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:13,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 13:14:13,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 13:14:13,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:13,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934585380] [2025-02-06 13:14:14,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934585380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:14:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175278297] [2025-02-06 13:14:14,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:14,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:14,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:14,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:14,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:14:14,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 13:14:14,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 13:14:14,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:14,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:14,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 13:14:14,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:14:14,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:14:14,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175278297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:14:14,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:14:14,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-02-06 13:14:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104105499] [2025-02-06 13:14:14,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:14:14,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:14:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:14,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:14:14,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:14:14,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-02-06 13:14:14,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 62 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:14,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:14,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-02-06 13:14:14,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:15,013 INFO L124 PetriNetUnfolderBase]: 1787/3918 cut-off events. [2025-02-06 13:14:15,014 INFO L125 PetriNetUnfolderBase]: For 4427/4428 co-relation queries the response was YES. [2025-02-06 13:14:15,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11009 conditions, 3918 events. 1787/3918 cut-off events. For 4427/4428 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19852 event pairs, 615 based on Foata normal form. 12/3851 useless extension candidates. Maximal degree in co-relation 10979. Up to 1125 conditions per place. [2025-02-06 13:14:15,029 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 100 selfloop transitions, 5 changer transitions 2/120 dead transitions. [2025-02-06 13:14:15,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 120 transitions, 824 flow [2025-02-06 13:14:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:14:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:14:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2025-02-06 13:14:15,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-02-06 13:14:15,032 INFO L175 Difference]: Start difference. First operand has 87 places, 62 transitions, 331 flow. Second operand 5 states and 200 transitions. [2025-02-06 13:14:15,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 120 transitions, 824 flow [2025-02-06 13:14:15,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 120 transitions, 793 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:14:15,039 INFO L231 Difference]: Finished difference. Result has 87 places, 63 transitions, 335 flow [2025-02-06 13:14:15,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=87, PETRI_TRANSITIONS=63} [2025-02-06 13:14:15,039 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-02-06 13:14:15,039 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 63 transitions, 335 flow [2025-02-06 13:14:15,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:15,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:15,039 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:15,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:14:15,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:15,240 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:15,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1723033863, now seen corresponding path program 1 times [2025-02-06 13:14:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:15,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114994438] [2025-02-06 13:14:15,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:15,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 13:14:15,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 13:14:15,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:15,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:14:15,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184314547] [2025-02-06 13:14:15,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:15,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:15,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:14:15,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 13:14:15,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 13:14:15,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:15,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:15,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:14:15,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:15,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:14:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:14:19,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:14:19,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114994438] [2025-02-06 13:14:19,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 13:14:19,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184314547] [2025-02-06 13:14:19,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184314547] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:14:19,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:14:19,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2025-02-06 13:14:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036076669] [2025-02-06 13:14:19,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:14:19,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:14:19,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:14:19,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:14:19,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:14:19,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-02-06 13:14:19,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 63 transitions, 335 flow. Second operand has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 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:19,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:14:19,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-02-06 13:14:19,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:14:22,247 INFO L124 PetriNetUnfolderBase]: 1754/3782 cut-off events. [2025-02-06 13:14:22,248 INFO L125 PetriNetUnfolderBase]: For 4107/4107 co-relation queries the response was YES. [2025-02-06 13:14:22,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10514 conditions, 3782 events. 1754/3782 cut-off events. For 4107/4107 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17188 event pairs, 314 based on Foata normal form. 29/3755 useless extension candidates. Maximal degree in co-relation 10482. Up to 652 conditions per place. [2025-02-06 13:14:22,267 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 156 selfloop transitions, 10 changer transitions 4/182 dead transitions. [2025-02-06 13:14:22,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 182 transitions, 1174 flow [2025-02-06 13:14:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:14:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:14:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2025-02-06 13:14:22,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-02-06 13:14:22,269 INFO L175 Difference]: Start difference. First operand has 87 places, 63 transitions, 335 flow. Second operand 10 states and 365 transitions. [2025-02-06 13:14:22,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 182 transitions, 1174 flow [2025-02-06 13:14:22,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 182 transitions, 1164 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 13:14:22,276 INFO L231 Difference]: Finished difference. Result has 96 places, 66 transitions, 379 flow [2025-02-06 13:14:22,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=379, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2025-02-06 13:14:22,277 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2025-02-06 13:14:22,277 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 379 flow [2025-02-06 13:14:22,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 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:22,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:14:22,277 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:14:22,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:14:22,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:22,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-02-06 13:14:22,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:14:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash -531993780, now seen corresponding path program 1 times [2025-02-06 13:14:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:14:22,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720673336] [2025-02-06 13:14:22,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:22,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:14:22,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 13:14:22,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 13:14:22,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:22,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 13:14:22,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201844417] [2025-02-06 13:14:22,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:14:22,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:14:22,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:14:22,545 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:14:22,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:14:22,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 13:14:22,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 13:14:22,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:14:22,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:14:22,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 13:14:22,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:14:23,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 13:14:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:14:23,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:14:23,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2025-02-06 13:14:23,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:14:23,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 274 [2025-02-06 13:14:24,143 INFO L349 Elim1Store]: treesize reduction 113, result has 27.6 percent of original size [2025-02-06 13:14:24,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 409 treesize of output 415 [2025-02-06 13:14:26,772 INFO L349 Elim1Store]: treesize reduction 1241, result has 26.7 percent of original size [2025-02-06 13:14:26,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 16 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 19 new quantified variables, introduced 81 case distinctions, treesize of input 696 treesize of output 4618 [2025-02-06 13:14:28,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:14:28,301 INFO L224 Elim1Store]: Index analysis took 242 ms [2025-02-06 13:14:28,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 2921 [2025-02-06 13:14:29,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 13:14:29,256 INFO L224 Elim1Store]: Index analysis took 214 ms [2025-02-06 13:14:29,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 2921 [2025-02-06 13:14:30,729 INFO L224 Elim1Store]: Index analysis took 598 ms [2025-02-06 13:14:30,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 2921 [2025-02-06 13:14:34,864 INFO L349 Elim1Store]: treesize reduction 160, result has 16.2 percent of original size [2025-02-06 13:14:34,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 177 [2025-02-06 13:14:34,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 13:14:34,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 127