./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.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/pthread-wmm/mix008_tso.oepc.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 5babed9169ff1f82a919f6310b42a42108866edd5cf3c99389faf03347963192 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:00:00,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:00:00,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:00:00,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:00:00,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:00:00,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:00:00,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:00:00,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:00:00,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:00:00,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:00:00,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:00:00,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:00:00,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:00:00,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:00:00,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:00:00,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:00:00,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:00:00,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:00:00,405 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 -> 5babed9169ff1f82a919f6310b42a42108866edd5cf3c99389faf03347963192 [2025-03-09 01:00:00,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:00:00,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:00:00,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:00:00,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:00:00,674 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:00:00,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i [2025-03-09 01:00:01,922 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed03f47c/2f43f613e7034faa93dce02350a70b65/FLAG608ac52fc [2025-03-09 01:00:02,208 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:00:02,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i [2025-03-09 01:00:02,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed03f47c/2f43f613e7034faa93dce02350a70b65/FLAG608ac52fc [2025-03-09 01:00:02,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed03f47c/2f43f613e7034faa93dce02350a70b65 [2025-03-09 01:00:02,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:00:02,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:00:02,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:00:02,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:00:02,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:00:02,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66aa4b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02, skipping insertion in model container [2025-03-09 01:00:02,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:00:02,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:00:02,806 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:00:02,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:00:02,897 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:00:02,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02 WrapperNode [2025-03-09 01:00:02,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:00:02,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:00:02,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:00:02,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:00:02,905 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:00:02" (1/1) ... [2025-03-09 01:00:02,919 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:00:02" (1/1) ... [2025-03-09 01:00:02,948 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 279 [2025-03-09 01:00:02,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:00:02,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:00:02,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:00:02,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:00:02,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,986 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-03-09 01:00:02,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:02,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:03,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:03,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:00:03,003 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:00:03,003 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:00:03,003 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:00:03,004 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (1/1) ... [2025-03-09 01:00:03,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:00:03,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:00:03,035 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:00:03,041 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:00:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:00:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:00:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:00:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:00:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:00:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:00:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-09 01:00:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-09 01:00:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-09 01:00:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-09 01:00:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:00:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:00:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:00:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:00:03,059 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:00:03,163 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:00:03,164 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:00:03,574 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:00:03,574 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:00:03,865 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:00:03,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:00:03,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:00:03 BoogieIcfgContainer [2025-03-09 01:00:03,866 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:00:03,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:00:03,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:00:03,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:00:03,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:00:02" (1/3) ... [2025-03-09 01:00:03,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c28b6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:00:03, skipping insertion in model container [2025-03-09 01:00:03,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:00:02" (2/3) ... [2025-03-09 01:00:03,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c28b6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:00:03, skipping insertion in model container [2025-03-09 01:00:03,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:00:03" (3/3) ... [2025-03-09 01:00:03,874 INFO L128 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2025-03-09 01:00:03,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:00:03,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix008_tso.oepc.i that has 5 procedures, 55 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 01:00:03,891 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:00:03,950 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:00:03,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 56 transitions, 128 flow [2025-03-09 01:00:04,009 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2025-03-09 01:00:04,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:00:04,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2025-03-09 01:00:04,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 56 transitions, 128 flow [2025-03-09 01:00:04,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 52 transitions, 116 flow [2025-03-09 01:00:04,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:00:04,035 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;@13d8274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:00:04,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:00:04,042 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:00:04,043 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-09 01:00:04,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:00:04,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:00:04,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:00:04,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-09 01:00:04,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:00:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 251927712, now seen corresponding path program 1 times [2025-03-09 01:00:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:00:04,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573617525] [2025-03-09 01:00:04,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:00:04,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:00:04,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:00:04,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:00:04,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:00:04,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:00:04,510 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:00:04,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:00:04,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573617525] [2025-03-09 01:00:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573617525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:00:04,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:00:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:00:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143634394] [2025-03-09 01:00:04,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:00:04,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:00:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:00:04,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:00:04,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:00:04,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2025-03-09 01:00:04,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:00:04,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:00:04,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2025-03-09 01:00:04,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:00:11,581 INFO L124 PetriNetUnfolderBase]: 67907/89771 cut-off events. [2025-03-09 01:00:11,581 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-09 01:00:11,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179023 conditions, 89771 events. 67907/89771 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 2609. Compared 556415 event pairs, 7283 based on Foata normal form. 4032/91226 useless extension candidates. Maximal degree in co-relation 179011. Up to 78337 conditions per place. [2025-03-09 01:00:12,098 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 66 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-03-09 01:00:12,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 303 flow [2025-03-09 01:00:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:00:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:00:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-09 01:00:12,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2025-03-09 01:00:12,108 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 109 transitions. [2025-03-09 01:00:12,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 303 flow [2025-03-09 01:00:12,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 76 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:00:12,117 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2025-03-09 01:00:12,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-03-09 01:00:12,122 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2025-03-09 01:00:12,124 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2025-03-09 01:00:12,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:00:12,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:00:12,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:00:12,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:00:12,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-09 01:00:12,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:00:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1583392153, now seen corresponding path program 1 times [2025-03-09 01:00:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:00:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672413769] [2025-03-09 01:00:12,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:00:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:00:12,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:00:12,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:00:12,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:00:12,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:00:12,303 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:00:12,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:00:12,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672413769] [2025-03-09 01:00:12,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672413769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:00:12,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:00:12,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:00:12,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925406440] [2025-03-09 01:00:12,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:00:12,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:00:12,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:00:12,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:00:12,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:00:12,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2025-03-09 01:00:12,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 108 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-03-09 01:00:12,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:00:12,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2025-03-09 01:00:12,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:00:18,357 INFO L124 PetriNetUnfolderBase]: 59279/78575 cut-off events. [2025-03-09 01:00:18,357 INFO L125 PetriNetUnfolderBase]: For 2592/2592 co-relation queries the response was YES. [2025-03-09 01:00:18,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159269 conditions, 78575 events. 59279/78575 cut-off events. For 2592/2592 co-relation queries the response was YES. Maximal size of possible extension queue 2191. Compared 470488 event pairs, 7511 based on Foata normal form. 0/78548 useless extension candidates. Maximal degree in co-relation 159259. Up to 66889 conditions per place. [2025-03-09 01:00:18,803 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 60 selfloop transitions, 2 changer transitions 2/72 dead transitions. [2025-03-09 01:00:18,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 286 flow [2025-03-09 01:00:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:00:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:00:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-09 01:00:18,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6011904761904762 [2025-03-09 01:00:18,805 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 3 states and 101 transitions. [2025-03-09 01:00:18,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 286 flow [2025-03-09 01:00:18,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:00:18,811 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-03-09 01:00:18,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-09 01:00:18,812 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2025-03-09 01:00:18,812 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-03-09 01:00:18,812 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-03-09 01:00:18,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:00:18,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:00:18,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:00:18,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-09 01:00:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:00:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1425108217, now seen corresponding path program 1 times [2025-03-09 01:00:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:00:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026779618] [2025-03-09 01:00:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:00:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:00:18,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:00:18,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:00:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:00:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:00:18,911 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:00:18,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:00:18,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026779618] [2025-03-09 01:00:18,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026779618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:00:18,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:00:18,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:00:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248417939] [2025-03-09 01:00:18,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:00:18,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:00:18,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:00:18,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:00:18,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:00:18,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 56 [2025-03-09 01:00:18,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 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-03-09 01:00:18,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:00:18,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 56 [2025-03-09 01:00:18,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:00:25,138 INFO L124 PetriNetUnfolderBase]: 53315/74879 cut-off events. [2025-03-09 01:00:25,138 INFO L125 PetriNetUnfolderBase]: For 2268/2268 co-relation queries the response was YES. [2025-03-09 01:00:25,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147521 conditions, 74879 events. 53315/74879 cut-off events. For 2268/2268 co-relation queries the response was YES. Maximal size of possible extension queue 2220. Compared 498189 event pairs, 53315 based on Foata normal form. 1764/76364 useless extension candidates. Maximal degree in co-relation 147511. Up to 69780 conditions per place. [2025-03-09 01:00:25,493 INFO L140 encePairwiseOnDemand]: 54/56 looper letters, 36 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-03-09 01:00:25,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 178 flow [2025-03-09 01:00:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:00:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:00:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-09 01:00:25,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-09 01:00:25,494 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 72 transitions. [2025-03-09 01:00:25,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 178 flow [2025-03-09 01:00:25,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:00:25,511 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-03-09 01:00:25,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-03-09 01:00:25,511 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-03-09 01:00:25,511 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-03-09 01:00:25,512 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-03-09 01:00:25,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:00:25,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:00:25,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:00:25,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-09 01:00:25,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:00:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1425108913, now seen corresponding path program 1 times [2025-03-09 01:00:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:00:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167465922] [2025-03-09 01:00:25,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:00:25,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:00:25,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:00:25,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:00:25,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:00:25,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:00:26,064 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:00:26,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:00:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167465922] [2025-03-09 01:00:26,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167465922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:00:26,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:00:26,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:00:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278997951] [2025-03-09 01:00:26,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:00:26,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:00:26,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:00:26,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:00:26,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:00:26,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 56 [2025-03-09 01:00:26,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 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-03-09 01:00:26,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:00:26,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 56 [2025-03-09 01:00:26,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand