./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix055.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/mix055.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 a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:45:14,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:45:14,153 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:45:14,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:45:14,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:45:14,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:45:14,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:45:14,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:45:14,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:45:14,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:45:14,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:45:14,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:45:14,178 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:45:14,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:45:14,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:45:14,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:45:14,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:45:14,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:45:14,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:45:14,180 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 -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 [2025-02-06 12:45:14,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:45:14,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:45:14,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:45:14,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:45:14,384 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:45:14,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix055.opt.i [2025-02-06 12:45:15,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4ac29619/3b6f44b57ef1406591ebbe550d86dda2/FLAGf72518741 [2025-02-06 12:45:15,753 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:45:15,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix055.opt.i [2025-02-06 12:45:15,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4ac29619/3b6f44b57ef1406591ebbe550d86dda2/FLAGf72518741 [2025-02-06 12:45:16,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4ac29619/3b6f44b57ef1406591ebbe550d86dda2 [2025-02-06 12:45:16,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:45:16,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:45:16,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:45:16,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:45:16,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:45:16,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c2119e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16, skipping insertion in model container [2025-02-06 12:45:16,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:45:16,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:45:16,375 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:45:16,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:45:16,461 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:45:16,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16 WrapperNode [2025-02-06 12:45:16,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:45:16,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:45:16,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:45:16,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:45:16,468 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:45:16" (1/1) ... [2025-02-06 12:45:16,477 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:45:16" (1/1) ... [2025-02-06 12:45:16,500 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2025-02-06 12:45:16,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:45:16,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:45:16,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:45:16,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:45:16,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,530 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:45:16,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:45:16,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:45:16,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:45:16,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:45:16,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (1/1) ... [2025-02-06 12:45:16,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:45:16,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:16,574 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:45:16,579 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:45:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:45:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:45:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:45:16,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:45:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:45:16,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:45:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:45:16,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:45:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-06 12:45:16,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-06 12:45:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:45:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:45:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:45:16,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:45:16,596 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:45:16,709 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:45:16,711 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:45:16,902 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:45:16,903 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:45:17,072 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:45:17,072 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:45:17,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:17 BoogieIcfgContainer [2025-02-06 12:45:17,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:45:17,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:45:17,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:45:17,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:45:17,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:45:16" (1/3) ... [2025-02-06 12:45:17,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c018a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:45:17, skipping insertion in model container [2025-02-06 12:45:17,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:16" (2/3) ... [2025-02-06 12:45:17,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c018a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:45:17, skipping insertion in model container [2025-02-06 12:45:17,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:17" (3/3) ... [2025-02-06 12:45:17,081 INFO L128 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2025-02-06 12:45:17,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:45:17,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix055.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:45:17,095 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:45:17,148 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:45:17,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2025-02-06 12:45:17,197 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-02-06 12:45:17,199 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:17,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-02-06 12:45:17,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2025-02-06 12:45:17,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2025-02-06 12:45:17,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:45:17,216 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;@6b30e01c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:45:17,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:45:17,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:45:17,223 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-06 12:45:17,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:17,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:17,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:17,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:45:17,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2104047721, now seen corresponding path program 1 times [2025-02-06 12:45:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623599734] [2025-02-06 12:45:17,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:17,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:45:17,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:45:17,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:17,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:17,543 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:45:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623599734] [2025-02-06 12:45:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623599734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:45:17,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145886878] [2025-02-06 12:45:17,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:17,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:45:17,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:17,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:45:17,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:45:17,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-06 12:45:17,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:45:17,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:17,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-06 12:45:17,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:21,263 INFO L124 PetriNetUnfolderBase]: 43115/57503 cut-off events. [2025-02-06 12:45:21,264 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-02-06 12:45:21,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114619 conditions, 57503 events. 43115/57503 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 338191 event pairs, 6395 based on Foata normal form. 2592/60060 useless extension candidates. Maximal degree in co-relation 114607. Up to 47521 conditions per place. [2025-02-06 12:45:21,707 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 57 selfloop transitions, 2 changer transitions 2/69 dead transitions. [2025-02-06 12:45:21,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 272 flow [2025-02-06 12:45:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:45:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:45:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-02-06 12:45:21,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2025-02-06 12:45:21,721 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 102 transitions. [2025-02-06 12:45:21,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 272 flow [2025-02-06 12:45:21,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 268 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:45:21,733 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2025-02-06 12:45:21,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-02-06 12:45:21,738 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-02-06 12:45:21,738 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2025-02-06 12:45:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:45:21,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:21,739 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:45:21,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:45:21,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:45:21,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash -628441300, now seen corresponding path program 1 times [2025-02-06 12:45:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:21,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128027321] [2025-02-06 12:45:21,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:21,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:45:21,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:45:21,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:21,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:21,843 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:45:21,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:21,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128027321] [2025-02-06 12:45:21,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128027321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:21,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:45:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896052617] [2025-02-06 12:45:21,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:21,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:45:21,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:21,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:45:21,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:45:21,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-02-06 12:45:21,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:45:21,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:21,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-02-06 12:45:21,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:25,361 INFO L124 PetriNetUnfolderBase]: 38795/54911 cut-off events. [2025-02-06 12:45:25,362 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2025-02-06 12:45:25,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108353 conditions, 54911 events. 38795/54911 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 1736. Compared 360627 event pairs, 38795 based on Foata normal form. 1296/56172 useless extension candidates. Maximal degree in co-relation 108343. Up to 50976 conditions per place. [2025-02-06 12:45:25,661 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-02-06 12:45:25,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 170 flow [2025-02-06 12:45:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:45:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:45:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-02-06 12:45:25,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2025-02-06 12:45:25,663 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 70 transitions. [2025-02-06 12:45:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 170 flow [2025-02-06 12:45:25,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:45:25,675 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-02-06 12:45:25,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-02-06 12:45:25,676 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-02-06 12:45:25,676 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-02-06 12:45:25,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:45:25,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:25,676 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:45:25,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:45:25,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:45:25,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash -628440581, now seen corresponding path program 1 times [2025-02-06 12:45:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:25,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763422950] [2025-02-06 12:45:25,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:25,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:45:25,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:45:25,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:25,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:26,363 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:45:26,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763422950] [2025-02-06 12:45:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763422950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:26,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:26,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:45:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146032236] [2025-02-06 12:45:26,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:26,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:45:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:26,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:45:26,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:45:26,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-02-06 12:45:26,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 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:45:26,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:26,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-02-06 12:45:26,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:32,419 INFO L124 PetriNetUnfolderBase]: 80008/108258 cut-off events. [2025-02-06 12:45:32,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:32,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214885 conditions, 108258 events. 80008/108258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3177. Compared 714853 event pairs, 3337 based on Foata normal form. 0/106310 useless extension candidates. Maximal degree in co-relation 214879. Up to 48371 conditions per place. [2025-02-06 12:45:32,936 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 75 selfloop transitions, 11 changer transitions 149/241 dead transitions. [2025-02-06 12:45:32,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 241 transitions, 972 flow [2025-02-06 12:45:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:45:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:45:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 370 transitions. [2025-02-06 12:45:32,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5817610062893082 [2025-02-06 12:45:32,939 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 12 states and 370 transitions. [2025-02-06 12:45:32,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 241 transitions, 972 flow [2025-02-06 12:45:32,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 241 transitions, 971 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:45:32,948 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 203 flow [2025-02-06 12:45:32,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=203, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-02-06 12:45:32,948 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2025-02-06 12:45:32,948 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 203 flow [2025-02-06 12:45:32,949 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:45:32,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:32,949 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:45:32,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:45:32,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:45:32,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:32,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1115730970, now seen corresponding path program 1 times [2025-02-06 12:45:32,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:32,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254624851] [2025-02-06 12:45:32,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:32,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:32,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:45:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:45:32,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:33,667 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:45:33,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:33,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254624851] [2025-02-06 12:45:33,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254624851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:33,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:33,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:45:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368240969] [2025-02-06 12:45:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:33,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:45:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:33,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:45:33,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:45:33,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-02-06 12:45:33,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:45:33,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:33,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-02-06 12:45:33,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:38,997 INFO L124 PetriNetUnfolderBase]: 63337/88023 cut-off events. [2025-02-06 12:45:38,998 INFO L125 PetriNetUnfolderBase]: For 103314/103329 co-relation queries the response was YES. [2025-02-06 12:45:39,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256401 conditions, 88023 events. 63337/88023 cut-off events. For 103314/103329 co-relation queries the response was YES. Maximal size of possible extension queue 2565. Compared 579784 event pairs, 17013 based on Foata normal form. 1946/89954 useless extension candidates. Maximal degree in co-relation 256385. Up to 66877 conditions per place. [2025-02-06 12:45:39,545 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 65 selfloop transitions, 4 changer transitions 83/158 dead transitions. [2025-02-06 12:45:39,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 158 transitions, 957 flow [2025-02-06 12:45:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:45:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:45:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2025-02-06 12:45:39,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444743935309974 [2025-02-06 12:45:39,547 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 203 flow. Second operand 7 states and 202 transitions. [2025-02-06 12:45:39,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 158 transitions, 957 flow [2025-02-06 12:45:44,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 158 transitions, 899 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-02-06 12:45:44,619 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 240 flow [2025-02-06 12:45:44,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2025-02-06 12:45:44,620 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2025-02-06 12:45:44,620 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 240 flow [2025-02-06 12:45:44,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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:45:44,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:44,620 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:45:44,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:45:44,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:45:44,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:44,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1596911768, now seen corresponding path program 1 times [2025-02-06 12:45:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:44,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961388913] [2025-02-06 12:45:44,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:44,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:45:44,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:45:44,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:44,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:45,345 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:45:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961388913] [2025-02-06 12:45:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961388913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:45:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45083622] [2025-02-06 12:45:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:45,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:45:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:45,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:45:45,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:45:45,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-02-06 12:45:45,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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:45:45,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:45,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-02-06 12:45:45,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand