./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe020_pso.oepc_pso.opt_tso.oepc_tso.opt.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-wmm/safe020_pso.oepc_pso.opt_tso.oepc_tso.opt.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 8e0b8e6efb6fc18f3ca2ba094d3acbfc6a07fbc0100e70485e3a3a84ea56105b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:50:09,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:50:09,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:50:09,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:50:09,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:50:10,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:50:10,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:50:10,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:50:10,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:50:10,025 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:50:10,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:50:10,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:50:10,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:50:10,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:50:10,028 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:50:10,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:50:10,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:50:10,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:50:10,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:50:10,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:50:10,030 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 -> 8e0b8e6efb6fc18f3ca2ba094d3acbfc6a07fbc0100e70485e3a3a84ea56105b [2025-02-06 12:50:10,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:50:10,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:50:10,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:50:10,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:50:10,313 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:50:10,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe020_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-02-06 12:50:11,668 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2590bd95e/252bb7c65281487b8ba2c58b6753e2dc/FLAGfb3371189 [2025-02-06 12:50:11,989 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:50:11,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe020_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-02-06 12:50:12,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2590bd95e/252bb7c65281487b8ba2c58b6753e2dc/FLAGfb3371189 [2025-02-06 12:50:12,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2590bd95e/252bb7c65281487b8ba2c58b6753e2dc [2025-02-06 12:50:12,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:50:12,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:50:12,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:50:12,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:50:12,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:50:12,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4b76aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12, skipping insertion in model container [2025-02-06 12:50:12,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:50:12,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:50:12,353 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:50:12,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:50:12,432 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:50:12,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12 WrapperNode [2025-02-06 12:50:12,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:50:12,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:50:12,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:50:12,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:50:12,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,472 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 59 [2025-02-06 12:50:12,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:50:12,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:50:12,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:50:12,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:50:12,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,508 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:50:12,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:50:12,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:50:12,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:50:12,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:50:12,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (1/1) ... [2025-02-06 12:50:12,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:50:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:50:12,569 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 12:50:12,576 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 12:50:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:50:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:50:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:50:12,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:50:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:50:12,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:50:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:50:12,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:50:12,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:50:12,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:50:12,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:50:12,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:50:12,600 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 12:50:12,731 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:50:12,734 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:50:12,931 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:50:12,934 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:50:13,049 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:50:13,050 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:50:13,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:13 BoogieIcfgContainer [2025-02-06 12:50:13,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:50:13,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:50:13,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:50:13,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:50:13,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:50:12" (1/3) ... [2025-02-06 12:50:13,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a199c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:50:13, skipping insertion in model container [2025-02-06 12:50:13,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:50:12" (2/3) ... [2025-02-06 12:50:13,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a199c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:50:13, skipping insertion in model container [2025-02-06 12:50:13,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:13" (3/3) ... [2025-02-06 12:50:13,065 INFO L128 eAbstractionObserver]: Analyzing ICFG safe020_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-02-06 12:50:13,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:50:13,084 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe020_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 12:50:13,084 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:50:13,137 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:50:13,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2025-02-06 12:50:13,199 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-02-06 12:50:13,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:50:13,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-02-06 12:50:13,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2025-02-06 12:50:13,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 39 transitions, 87 flow [2025-02-06 12:50:13,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:50:13,233 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;@4831005e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:50:13,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 12:50:13,249 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:50:13,250 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-02-06 12:50:13,250 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:50:13,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:13,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:50:13,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2105177879, now seen corresponding path program 1 times [2025-02-06 12:50:13,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:13,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585254754] [2025-02-06 12:50:13,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:13,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:50:13,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:50:13,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:13,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:13,559 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 12:50:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:13,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585254754] [2025-02-06 12:50:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585254754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:13,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:13,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:50:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456368395] [2025-02-06 12:50:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:13,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:50:13,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:13,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:50:13,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:50:13,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 12:50:13,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 12:50:13,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:13,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 12:50:13,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:14,501 INFO L124 PetriNetUnfolderBase]: 4626/7240 cut-off events. [2025-02-06 12:50:14,502 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-06 12:50:14,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13932 conditions, 7240 events. 4626/7240 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 42795 event pairs, 4626 based on Foata normal form. 630/7864 useless extension candidates. Maximal degree in co-relation 13921. Up to 6601 conditions per place. [2025-02-06 12:50:14,570 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:50:14,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 35 transitions, 137 flow [2025-02-06 12:50:14,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:50:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:50:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-06 12:50:14,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2025-02-06 12:50:14,583 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 87 flow. Second operand 3 states and 59 transitions. [2025-02-06 12:50:14,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 35 transitions, 137 flow [2025-02-06 12:50:14,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:50:14,593 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-02-06 12:50:14,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-02-06 12:50:14,599 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2025-02-06 12:50:14,599 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-02-06 12:50:14,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 12:50:14,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:14,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:50:14,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:50:14,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:14,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2105177449, now seen corresponding path program 1 times [2025-02-06 12:50:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:14,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859863612] [2025-02-06 12:50:14,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:14,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:14,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:50:14,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:50:14,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:14,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:15,015 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 12:50:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859863612] [2025-02-06 12:50:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859863612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:15,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:15,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:50:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859966346] [2025-02-06 12:50:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:15,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:50:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:15,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:50:15,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:50:15,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 12:50:15,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 12:50:15,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:15,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 12:50:15,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:16,408 INFO L124 PetriNetUnfolderBase]: 9126/13525 cut-off events. [2025-02-06 12:50:16,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:50:16,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26766 conditions, 13525 events. 9126/13525 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 82886 event pairs, 2230 based on Foata normal form. 0/13198 useless extension candidates. Maximal degree in co-relation 26760. Up to 5242 conditions per place. [2025-02-06 12:50:16,487 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 47 selfloop transitions, 5 changer transitions 93/150 dead transitions. [2025-02-06 12:50:16,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 150 transitions, 602 flow [2025-02-06 12:50:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:50:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:50:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2025-02-06 12:50:16,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2025-02-06 12:50:16,492 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 9 states and 228 transitions. [2025-02-06 12:50:16,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 150 transitions, 602 flow [2025-02-06 12:50:16,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 150 transitions, 601 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:50:16,498 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 126 flow [2025-02-06 12:50:16,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2025-02-06 12:50:16,499 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2025-02-06 12:50:16,499 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 126 flow [2025-02-06 12:50:16,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 12:50:16,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:16,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:50:16,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:50:16,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2139615882, now seen corresponding path program 1 times [2025-02-06 12:50:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38712795] [2025-02-06 12:50:16,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:16,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:50:16,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:50:16,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:16,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:16,730 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 12:50:16,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:16,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38712795] [2025-02-06 12:50:16,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38712795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:16,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:16,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:50:16,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529395745] [2025-02-06 12:50:16,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:16,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:50:16,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:16,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:50:16,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:50:16,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 12:50:16,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 12:50:16,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:16,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 12:50:16,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:17,785 INFO L124 PetriNetUnfolderBase]: 6878/10337 cut-off events. [2025-02-06 12:50:17,785 INFO L125 PetriNetUnfolderBase]: For 6058/6073 co-relation queries the response was YES. [2025-02-06 12:50:17,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25339 conditions, 10337 events. 6878/10337 cut-off events. For 6058/6073 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 60726 event pairs, 744 based on Foata normal form. 260/10591 useless extension candidates. Maximal degree in co-relation 25326. Up to 4333 conditions per place. [2025-02-06 12:50:17,840 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 56 selfloop transitions, 6 changer transitions 74/141 dead transitions. [2025-02-06 12:50:17,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 141 transitions, 697 flow [2025-02-06 12:50:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:50:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:50:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 228 transitions. [2025-02-06 12:50:17,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5302325581395348 [2025-02-06 12:50:17,844 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 126 flow. Second operand 10 states and 228 transitions. [2025-02-06 12:50:17,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 141 transitions, 697 flow [2025-02-06 12:50:17,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 141 transitions, 659 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-02-06 12:50:17,968 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 151 flow [2025-02-06 12:50:17,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2025-02-06 12:50:17,969 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2025-02-06 12:50:17,970 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 151 flow [2025-02-06 12:50:17,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 12:50:17,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:17,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:50:17,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:50:17,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash 264043510, now seen corresponding path program 1 times [2025-02-06 12:50:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88805177] [2025-02-06 12:50:17,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:17,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:50:17,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:50:17,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:17,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:18,254 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 12:50:18,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88805177] [2025-02-06 12:50:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88805177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:18,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:18,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:50:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352094138] [2025-02-06 12:50:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:18,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:50:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:18,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:50:18,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:50:18,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 12:50:18,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 12:50:18,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:18,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 12:50:18,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:19,289 INFO L124 PetriNetUnfolderBase]: 6819/10258 cut-off events. [2025-02-06 12:50:19,289 INFO L125 PetriNetUnfolderBase]: For 14289/14289 co-relation queries the response was YES. [2025-02-06 12:50:19,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27520 conditions, 10258 events. 6819/10258 cut-off events. For 14289/14289 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 61002 event pairs, 564 based on Foata normal form. 295/10551 useless extension candidates. Maximal degree in co-relation 27501. Up to 4748 conditions per place. [2025-02-06 12:50:19,354 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 55 selfloop transitions, 7 changer transitions 68/135 dead transitions. [2025-02-06 12:50:19,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 135 transitions, 724 flow [2025-02-06 12:50:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:50:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:50:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 222 transitions. [2025-02-06 12:50:19,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5162790697674419 [2025-02-06 12:50:19,358 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 151 flow. Second operand 10 states and 222 transitions. [2025-02-06 12:50:19,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 135 transitions, 724 flow [2025-02-06 12:50:19,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 135 transitions, 658 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-02-06 12:50:19,491 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 166 flow [2025-02-06 12:50:19,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=166, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2025-02-06 12:50:19,492 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2025-02-06 12:50:19,492 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 166 flow [2025-02-06 12:50:19,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 12:50:19,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:19,492 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 12:50:19,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:50:19,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:19,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2002046499, now seen corresponding path program 1 times [2025-02-06 12:50:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:19,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682754943] [2025-02-06 12:50:19,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:19,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:50:19,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:50:19,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:19,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:19,657 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 12:50:19,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682754943] [2025-02-06 12:50:19,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682754943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:19,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:19,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:50:19,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287501958] [2025-02-06 12:50:19,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:19,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:50:19,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:19,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:50:19,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:50:19,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 12:50:19,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 12:50:19,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:19,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 12:50:19,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:20,480 INFO L124 PetriNetUnfolderBase]: 9029/13570 cut-off events. [2025-02-06 12:50:20,481 INFO L125 PetriNetUnfolderBase]: For 15204/15210 co-relation queries the response was YES. [2025-02-06 12:50:20,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35248 conditions, 13570 events. 9029/13570 cut-off events. For 15204/15210 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 82197 event pairs, 1487 based on Foata normal form. 270/13838 useless extension candidates. Maximal degree in co-relation 35228. Up to 5972 conditions per place. [2025-02-06 12:50:20,531 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 53 selfloop transitions, 4 changer transitions 70/132 dead transitions. [2025-02-06 12:50:20,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 132 transitions, 803 flow [2025-02-06 12:50:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:50:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:50:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2025-02-06 12:50:20,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2025-02-06 12:50:20,533 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 166 flow. Second operand 8 states and 184 transitions. [2025-02-06 12:50:20,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 132 transitions, 803 flow [2025-02-06 12:50:20,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 132 transitions, 729 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-02-06 12:50:20,605 INFO L231 Difference]: Finished difference. Result has 63 places, 38 transitions, 167 flow [2025-02-06 12:50:20,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=63, PETRI_TRANSITIONS=38} [2025-02-06 12:50:20,606 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2025-02-06 12:50:20,606 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 38 transitions, 167 flow [2025-02-06 12:50:20,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 12:50:20,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:20,606 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] [2025-02-06 12:50:20,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:50:20,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:20,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2102746294, now seen corresponding path program 1 times [2025-02-06 12:50:20,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:20,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410350272] [2025-02-06 12:50:20,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:20,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:50:20,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:50:20,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:20,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:20,834 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 12:50:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410350272] [2025-02-06 12:50:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410350272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:20,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:20,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:50:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870165601] [2025-02-06 12:50:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:50:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:20,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:50:20,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:50:20,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-06 12:50:20,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 38 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 12:50:20,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:20,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-06 12:50:20,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:21,130 INFO L124 PetriNetUnfolderBase]: 3982/6319 cut-off events. [2025-02-06 12:50:21,131 INFO L125 PetriNetUnfolderBase]: For 5565/5574 co-relation queries the response was YES. [2025-02-06 12:50:21,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16186 conditions, 6319 events. 3982/6319 cut-off events. For 5565/5574 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 36304 event pairs, 649 based on Foata normal form. 271/6585 useless extension candidates. Maximal degree in co-relation 16165. Up to 3504 conditions per place. [2025-02-06 12:50:21,168 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 70 selfloop transitions, 5 changer transitions 1/81 dead transitions. [2025-02-06 12:50:21,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 515 flow [2025-02-06 12:50:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:50:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:50:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-06 12:50:21,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5988372093023255 [2025-02-06 12:50:21,170 INFO L175 Difference]: Start difference. First operand has 63 places, 38 transitions, 167 flow. Second operand 4 states and 103 transitions. [2025-02-06 12:50:21,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 515 flow [2025-02-06 12:50:21,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 479 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-02-06 12:50:21,190 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 179 flow [2025-02-06 12:50:21,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-02-06 12:50:21,191 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2025-02-06 12:50:21,191 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 179 flow [2025-02-06 12:50:21,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 12:50:21,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:21,191 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 12:50:21,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:50:21,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:21,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:21,192 INFO L85 PathProgramCache]: Analyzing trace with hash 213474091, now seen corresponding path program 1 times [2025-02-06 12:50:21,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:21,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359692115] [2025-02-06 12:50:21,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:21,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:21,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:50:21,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:50:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:21,448 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 12:50:21,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:21,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359692115] [2025-02-06 12:50:21,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359692115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:21,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:21,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:50:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588297720] [2025-02-06 12:50:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:21,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:50:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:21,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:50:21,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:50:21,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-06 12:50:21,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 12:50:21,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:21,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-06 12:50:21,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:21,754 INFO L124 PetriNetUnfolderBase]: 2377/3799 cut-off events. [2025-02-06 12:50:21,755 INFO L125 PetriNetUnfolderBase]: For 3110/3119 co-relation queries the response was YES. [2025-02-06 12:50:21,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10318 conditions, 3799 events. 2377/3799 cut-off events. For 3110/3119 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 19388 event pairs, 333 based on Foata normal form. 210/4004 useless extension candidates. Maximal degree in co-relation 10301. Up to 1305 conditions per place. [2025-02-06 12:50:21,769 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 79 selfloop transitions, 8 changer transitions 2/94 dead transitions. [2025-02-06 12:50:21,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 94 transitions, 582 flow [2025-02-06 12:50:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:50:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:50:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-02-06 12:50:21,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 12:50:21,770 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 179 flow. Second operand 5 states and 129 transitions. [2025-02-06 12:50:21,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 94 transitions, 582 flow [2025-02-06 12:50:21,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 94 transitions, 563 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 12:50:21,777 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 213 flow [2025-02-06 12:50:21,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-02-06 12:50:21,778 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2025-02-06 12:50:21,780 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 213 flow [2025-02-06 12:50:21,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 12:50:21,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:21,781 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] [2025-02-06 12:50:21,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:50:21,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1234772352, now seen corresponding path program 1 times [2025-02-06 12:50:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:21,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543325209] [2025-02-06 12:50:21,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:21,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:50:21,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:50:21,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:21,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:21,898 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 12:50:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543325209] [2025-02-06 12:50:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543325209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:50:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636917661] [2025-02-06 12:50:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:50:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:21,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:50:21,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:50:21,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-06 12:50:21,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 12:50:21,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:21,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-06 12:50:21,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:22,136 INFO L124 PetriNetUnfolderBase]: 1420/2236 cut-off events. [2025-02-06 12:50:22,137 INFO L125 PetriNetUnfolderBase]: For 3031/3040 co-relation queries the response was YES. [2025-02-06 12:50:22,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6619 conditions, 2236 events. 1420/2236 cut-off events. For 3031/3040 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10102 event pairs, 256 based on Foata normal form. 92/2323 useless extension candidates. Maximal degree in co-relation 6601. Up to 766 conditions per place. [2025-02-06 12:50:22,143 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 62 selfloop transitions, 11 changer transitions 8/86 dead transitions. [2025-02-06 12:50:22,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 538 flow [2025-02-06 12:50:22,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:50:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:50:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-02-06 12:50:22,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2025-02-06 12:50:22,145 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 213 flow. Second operand 6 states and 132 transitions. [2025-02-06 12:50:22,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 538 flow [2025-02-06 12:50:22,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 501 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 12:50:22,155 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 218 flow [2025-02-06 12:50:22,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2025-02-06 12:50:22,158 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-02-06 12:50:22,159 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 218 flow [2025-02-06 12:50:22,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 12:50:22,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:22,159 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, 1, 1] [2025-02-06 12:50:22,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:50:22,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:22,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash 936729686, now seen corresponding path program 1 times [2025-02-06 12:50:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:22,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188903600] [2025-02-06 12:50:22,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:50:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:22,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:50:22,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:50:22,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:50:22,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:22,317 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 12:50:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188903600] [2025-02-06 12:50:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188903600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:22,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:50:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163186360] [2025-02-06 12:50:22,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:22,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:50:22,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:22,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:50:22,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:50:22,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 12:50:22,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 12:50:22,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:22,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 12:50:22,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:22,530 INFO L124 PetriNetUnfolderBase]: 1544/2431 cut-off events. [2025-02-06 12:50:22,530 INFO L125 PetriNetUnfolderBase]: For 3055/3055 co-relation queries the response was YES. [2025-02-06 12:50:22,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 2431 events. 1544/2431 cut-off events. For 3055/3055 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11012 event pairs, 232 based on Foata normal form. 8/2437 useless extension candidates. Maximal degree in co-relation 7144. Up to 1201 conditions per place. [2025-02-06 12:50:22,539 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 43 selfloop transitions, 4 changer transitions 29/81 dead transitions. [2025-02-06 12:50:22,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 81 transitions, 529 flow [2025-02-06 12:50:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:50:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:50:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-02-06 12:50:22,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2025-02-06 12:50:22,540 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 218 flow. Second operand 6 states and 118 transitions. [2025-02-06 12:50:22,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 81 transitions, 529 flow [2025-02-06 12:50:22,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 408 flow, removed 24 selfloop flow, removed 10 redundant places. [2025-02-06 12:50:22,554 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 141 flow [2025-02-06 12:50:22,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2025-02-06 12:50:22,555 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2025-02-06 12:50:22,555 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 141 flow [2025-02-06 12:50:22,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 12:50:22,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:50:22,556 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, 1, 1] [2025-02-06 12:50:22,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:50:22,557 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:50:22,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:50:22,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1766488200, now seen corresponding path program 2 times [2025-02-06 12:50:22,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:50:22,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452329837] [2025-02-06 12:50:22,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:50:22,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:50:22,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:50:22,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:50:22,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:50:22,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:50:22,678 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 12:50:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:50:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452329837] [2025-02-06 12:50:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452329837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:50:22,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:50:22,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:50:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178961850] [2025-02-06 12:50:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:50:22,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:50:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:50:22,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:50:22,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:50:22,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-06 12:50:22,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 12:50:22,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:50:22,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-06 12:50:22,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:50:22,824 INFO L124 PetriNetUnfolderBase]: 506/804 cut-off events. [2025-02-06 12:50:22,824 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2025-02-06 12:50:22,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 804 events. 506/804 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2693 event pairs, 126 based on Foata normal form. 8/812 useless extension candidates. Maximal degree in co-relation 2002. Up to 444 conditions per place. [2025-02-06 12:50:22,827 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2025-02-06 12:50:22,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 281 flow [2025-02-06 12:50:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:50:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:50:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-02-06 12:50:22,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3798449612403101 [2025-02-06 12:50:22,828 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 141 flow. Second operand 6 states and 98 transitions. [2025-02-06 12:50:22,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 281 flow [2025-02-06 12:50:22,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 251 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-02-06 12:50:22,829 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2025-02-06 12:50:22,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2025-02-06 12:50:22,830 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2025-02-06 12:50:22,830 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2025-02-06 12:50:22,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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 12:50:22,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-02-06 12:50:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-06 12:50:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-06 12:50:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-06 12:50:22,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-02-06 12:50:22,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:50:22,835 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:50:22,838 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:50:22,838 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:50:22,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:50:22 BasicIcfg [2025-02-06 12:50:22,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:50:22,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:50:22,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:50:22,845 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:50:22,846 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:50:13" (3/4) ... [2025-02-06 12:50:22,848 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 12:50:22,851 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-02-06 12:50:22,852 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-02-06 12:50:22,852 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-02-06 12:50:22,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-02-06 12:50:22,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-06 12:50:22,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 12:50:22,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 12:50:22,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 12:50:22,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 12:50:22,924 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:50:22,925 INFO L158 Benchmark]: Toolchain (without parser) took 10889.92ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 121.6MB in the beginning and 173.0MB in the end (delta: -51.4MB). Peak memory consumption was 280.4MB. Max. memory is 16.1GB. [2025-02-06 12:50:22,926 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:50:22,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.48ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 101.5MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:50:22,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.09ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 99.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:50:22,927 INFO L158 Benchmark]: Boogie Preprocessor took 56.28ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 98.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:50:22,927 INFO L158 Benchmark]: IcfgBuilder took 519.01ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 78.8MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:50:22,928 INFO L158 Benchmark]: TraceAbstraction took 9789.22ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 78.2MB in the beginning and 176.8MB in the end (delta: -98.7MB). Peak memory consumption was 238.5MB. Max. memory is 16.1GB. [2025-02-06 12:50:22,928 INFO L158 Benchmark]: Witness Printer took 79.27ms. Allocated memory is still 503.3MB. Free memory was 176.8MB in the beginning and 173.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:50:22,929 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.48ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 101.5MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.09ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 99.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.28ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 98.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 519.01ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 78.8MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9789.22ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 78.2MB in the beginning and 176.8MB in the end (delta: -98.7MB). Peak memory consumption was 238.5MB. Max. memory is 16.1GB. * Witness Printer took 79.27ms. Allocated memory is still 503.3MB. Free memory was 176.8MB in the beginning and 173.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 773]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 683 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1600 IncrementalHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 3 mSDtfsCounter, 1600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 12:50:22,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE