./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d5772eac83993f999ed7a0d2c72e283c734e18136b4020af8f8e407255c20c04 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:14:21,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:14:21,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:14:21,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:14:21,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:14:21,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:14:21,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:14:21,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:14:21,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:14:21,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:14:21,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:14:21,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:14:21,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:14:21,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:14:21,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:14:21,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:14:21,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:14:21,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:14:21,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:14:21,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:14:21,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:14:21,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:14:21,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:14:21,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:14:21,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:14:21,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:14:21,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:14:21,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:14:21,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:14:21,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:14:21,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:14:21,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:14:21,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:14:21,853 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/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 -> d5772eac83993f999ed7a0d2c72e283c734e18136b4020af8f8e407255c20c04 [2025-03-09 01:14:22,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:14:22,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:14:22,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:14:22,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:14:22,087 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:14:22,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i [2025-03-09 01:14:23,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688a5675e/d6affb3f46a7413c9e9c787a128da80a/FLAGc191edc30 [2025-03-09 01:14:23,545 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:14:23,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i [2025-03-09 01:14:23,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688a5675e/d6affb3f46a7413c9e9c787a128da80a/FLAGc191edc30 [2025-03-09 01:14:23,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688a5675e/d6affb3f46a7413c9e9c787a128da80a [2025-03-09 01:14:23,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:14:23,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:14:23,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:14:23,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:14:23,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:14:23,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:23,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cb8559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23, skipping insertion in model container [2025-03-09 01:14:23,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:23,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:14:23,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:14:23,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:14:23,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:14:23,946 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:14:23,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23 WrapperNode [2025-03-09 01:14:23,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:14:23,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:14:23,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:14:23,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:14:23,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:23,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:23,978 INFO L138 Inliner]: procedures = 271, calls = 38, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 98 [2025-03-09 01:14:23,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:14:23,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:14:23,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:14:23,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:14:23,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:23,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:23,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:24,001 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-03-09 01:14:24,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:24,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:24,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:24,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:24,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:24,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:24,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:14:24,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:14:24,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:14:24,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:14:24,016 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (1/1) ... [2025-03-09 01:14:24,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:14:24,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:14:24,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:14:24,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2025-03-09 01:14:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2025-03-09 01:14:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure process [2025-03-09 01:14:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:14:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:14:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:14:24,062 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:14:24,268 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:14:24,270 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:14:24,475 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:14:24,476 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:14:24,596 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:14:24,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:14:24,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:14:24 BoogieIcfgContainer [2025-03-09 01:14:24,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:14:24,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:14:24,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:14:24,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:14:24,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:14:23" (1/3) ... [2025-03-09 01:14:24,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a392892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:14:24, skipping insertion in model container [2025-03-09 01:14:24,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:14:23" (2/3) ... [2025-03-09 01:14:24,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a392892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:14:24, skipping insertion in model container [2025-03-09 01:14:24,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:14:24" (3/3) ... [2025-03-09 01:14:24,605 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2025-03-09 01:14:24,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:14:24,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_04-priv_multi_true.i that has 4 procedures, 60 locations, 1 initial locations, 4 loop locations, and 3 error locations. [2025-03-09 01:14:24,619 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:14:24,660 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:14:24,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 150 flow [2025-03-09 01:14:24,710 INFO L124 PetriNetUnfolderBase]: 10/66 cut-off events. [2025-03-09 01:14:24,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:14:24,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 66 events. 10/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 167 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2025-03-09 01:14:24,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 69 transitions, 150 flow [2025-03-09 01:14:24,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 66 transitions, 141 flow [2025-03-09 01:14:24,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:14:24,731 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;@24c41b38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:14:24,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 01:14:24,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:14:24,738 INFO L124 PetriNetUnfolderBase]: 2/29 cut-off events. [2025-03-09 01:14:24,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:14:24,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:24,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:24,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 01:14:24,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash 424982200, now seen corresponding path program 1 times [2025-03-09 01:14:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654548436] [2025-03-09 01:14:24,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:24,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:14:24,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:14:24,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:24,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654548436] [2025-03-09 01:14:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654548436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:25,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:14:25,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:14:25,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955133576] [2025-03-09 01:14:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:14:25,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:25,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:14:25,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:14:25,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 69 [2025-03-09 01:14:25,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-03-09 01:14:25,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:25,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 69 [2025-03-09 01:14:25,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:27,416 INFO L124 PetriNetUnfolderBase]: 24209/38167 cut-off events. [2025-03-09 01:14:27,417 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-09 01:14:27,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70552 conditions, 38167 events. 24209/38167 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 288292 event pairs, 12107 based on Foata normal form. 4212/42146 useless extension candidates. Maximal degree in co-relation 70541. Up to 18819 conditions per place. [2025-03-09 01:14:27,821 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 67 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-03-09 01:14:27,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 323 flow [2025-03-09 01:14:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:14:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:14:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-03-09 01:14:27,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.714975845410628 [2025-03-09 01:14:27,833 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 141 flow. Second operand 3 states and 148 transitions. [2025-03-09 01:14:27,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 323 flow [2025-03-09 01:14:27,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 320 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:14:27,841 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 134 flow [2025-03-09 01:14:27,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-09 01:14:27,846 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2025-03-09 01:14:27,846 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 134 flow [2025-03-09 01:14:27,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-03-09 01:14:27,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:27,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:27,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:14:27,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 01:14:27,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash -518245358, now seen corresponding path program 1 times [2025-03-09 01:14:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:27,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296264982] [2025-03-09 01:14:27,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:27,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:14:27,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:14:27,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:27,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:28,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296264982] [2025-03-09 01:14:28,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296264982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:28,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:14:28,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:14:28,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92589138] [2025-03-09 01:14:28,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:28,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:14:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:28,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:14:28,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:14:28,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 69 [2025-03-09 01:14:28,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-03-09 01:14:28,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:28,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 69 [2025-03-09 01:14:28,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:30,381 INFO L124 PetriNetUnfolderBase]: 34593/49653 cut-off events. [2025-03-09 01:14:30,382 INFO L125 PetriNetUnfolderBase]: For 2760/2760 co-relation queries the response was YES. [2025-03-09 01:14:30,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97803 conditions, 49653 events. 34593/49653 cut-off events. For 2760/2760 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 341710 event pairs, 5785 based on Foata normal form. 0/48715 useless extension candidates. Maximal degree in co-relation 97793. Up to 32317 conditions per place. [2025-03-09 01:14:30,694 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 101 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2025-03-09 01:14:30,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 128 transitions, 506 flow [2025-03-09 01:14:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:14:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:14:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2025-03-09 01:14:30,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2025-03-09 01:14:30,696 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 134 flow. Second operand 5 states and 215 transitions. [2025-03-09 01:14:30,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 128 transitions, 506 flow [2025-03-09 01:14:30,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:14:30,702 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 198 flow [2025-03-09 01:14:30,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-03-09 01:14:30,703 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2025-03-09 01:14:30,703 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 198 flow [2025-03-09 01:14:30,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-03-09 01:14:30,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:30,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:14:30,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:14:30,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting disposeErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 01:14:30,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1187660097, now seen corresponding path program 1 times [2025-03-09 01:14:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:30,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171107917] [2025-03-09 01:14:30,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:30,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:30,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:14:30,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:14:30,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:30,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:31,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:31,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171107917] [2025-03-09 01:14:31,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171107917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:31,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:14:31,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:14:31,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484636959] [2025-03-09 01:14:31,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:31,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:14:31,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:31,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:14:31,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:14:31,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 69 [2025-03-09 01:14:31,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-03-09 01:14:31,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:31,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 69 [2025-03-09 01:14:31,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:35,859 INFO L124 PetriNetUnfolderBase]: 72962/105744 cut-off events. [2025-03-09 01:14:35,860 INFO L125 PetriNetUnfolderBase]: For 48422/50435 co-relation queries the response was YES. [2025-03-09 01:14:36,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236583 conditions, 105744 events. 72962/105744 cut-off events. For 48422/50435 co-relation queries the response was YES. Maximal size of possible extension queue 2307. Compared 776738 event pairs, 10656 based on Foata normal form. 0/102508 useless extension candidates. Maximal degree in co-relation 236568. Up to 37321 conditions per place. [2025-03-09 01:14:36,573 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 214 selfloop transitions, 12 changer transitions 0/244 dead transitions. [2025-03-09 01:14:36,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 244 transitions, 1212 flow [2025-03-09 01:14:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:14:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:14:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 365 transitions. [2025-03-09 01:14:36,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612318840579711 [2025-03-09 01:14:36,575 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 198 flow. Second operand 8 states and 365 transitions. [2025-03-09 01:14:36,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 244 transitions, 1212 flow [2025-03-09 01:14:36,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 244 transitions, 1212 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:14:36,626 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 286 flow [2025-03-09 01:14:36,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=286, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-03-09 01:14:36,627 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-03-09 01:14:36,628 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 286 flow [2025-03-09 01:14:36,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-03-09 01:14:36,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:36,628 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-03-09 01:14:36,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:14:36,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 01:14:36,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 546960120, now seen corresponding path program 1 times [2025-03-09 01:14:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436233766] [2025-03-09 01:14:36,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:36,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:14:36,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:14:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:36,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:36,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436233766] [2025-03-09 01:14:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436233766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:14:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:14:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679919559] [2025-03-09 01:14:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:36,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:14:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:36,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:14:36,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:14:36,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 69 [2025-03-09 01:14:36,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:14:36,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:36,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 69 [2025-03-09 01:14:36,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:14:45,618 INFO L124 PetriNetUnfolderBase]: 101018/157246 cut-off events. [2025-03-09 01:14:45,618 INFO L125 PetriNetUnfolderBase]: For 125081/129443 co-relation queries the response was YES. [2025-03-09 01:14:46,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397499 conditions, 157246 events. 101018/157246 cut-off events. For 125081/129443 co-relation queries the response was YES. Maximal size of possible extension queue 3625. Compared 1348760 event pairs, 23776 based on Foata normal form. 6692/162885 useless extension candidates. Maximal degree in co-relation 397476. Up to 81023 conditions per place. [2025-03-09 01:14:46,963 INFO L140 encePairwiseOnDemand]: 58/69 looper letters, 94 selfloop transitions, 11 changer transitions 0/126 dead transitions. [2025-03-09 01:14:46,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 705 flow [2025-03-09 01:14:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:14:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:14:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2025-03-09 01:14:46,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6859903381642513 [2025-03-09 01:14:46,964 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 286 flow. Second operand 3 states and 142 transitions. [2025-03-09 01:14:46,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 705 flow [2025-03-09 01:14:48,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 126 transitions, 705 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:14:48,719 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 351 flow [2025-03-09 01:14:48,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2025-03-09 01:14:48,720 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 19 predicate places. [2025-03-09 01:14:48,720 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 351 flow [2025-03-09 01:14:48,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:14:48,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:14:48,720 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] [2025-03-09 01:14:48,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:14:48,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 01:14:48,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:14:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1132481894, now seen corresponding path program 1 times [2025-03-09 01:14:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:14:48,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385029679] [2025-03-09 01:14:48,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:14:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:14:48,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:14:48,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:14:48,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:14:48,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:14:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:14:48,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:14:48,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385029679] [2025-03-09 01:14:48,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385029679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:14:48,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:14:48,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:14:48,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988046235] [2025-03-09 01:14:48,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:14:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:14:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:14:48,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:14:48,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:14:48,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 69 [2025-03-09 01:14:48,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-03-09 01:14:48,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:14:48,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 69 [2025-03-09 01:14:48,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand