./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix037.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/mix037.opt.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 be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:50:45,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:50:45,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:50:45,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:50:45,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:50:45,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:50:45,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:50:45,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:50:45,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:50:45,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:50:45,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:50:45,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:50:45,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:50:45,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:50:45,341 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:50:45,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:50:45,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:50:45,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:50:45,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:50:45,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:50:45,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:50:45,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:50:45,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:50:45,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:50:45,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:50:45,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:50:45,343 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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2025-03-04 09:50:45,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:50:45,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:50:45,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:50:45,583 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:50:45,583 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:50:45,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2025-03-04 09:50:46,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be5ad5c5/3452b68a41a2460cab6387610b9c3877/FLAG9536be867 [2025-03-04 09:50:47,013 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:50:47,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2025-03-04 09:50:47,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be5ad5c5/3452b68a41a2460cab6387610b9c3877/FLAG9536be867 [2025-03-04 09:50:47,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be5ad5c5/3452b68a41a2460cab6387610b9c3877 [2025-03-04 09:50:47,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:50:47,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:50:47,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:50:47,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:50:47,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:50:47,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0ad6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47, skipping insertion in model container [2025-03-04 09:50:47,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:50:47,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:50:47,362 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:50:47,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:50:47,445 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:50:47,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47 WrapperNode [2025-03-04 09:50:47,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:50:47,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:50:47,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:50:47,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:50:47,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,484 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2025-03-04 09:50:47,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:50:47,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:50:47,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:50:47,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:50:47,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,505 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-04 09:50:47,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:50:47,514 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:50:47,514 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:50:47,514 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:50:47,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (1/1) ... [2025-03-04 09:50:47,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:50:47,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:50:47,547 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-04 09:50:47,552 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-04 09:50:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:50:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:50:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:50:47,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:50:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:50:47,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:50:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:50:47,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:50:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 09:50:47,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 09:50:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:50:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:50:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:50:47,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:50:47,571 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:50:47,682 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:50:47,684 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:50:47,921 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:50:47,921 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:50:48,086 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:50:48,086 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:50:48,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:50:48 BoogieIcfgContainer [2025-03-04 09:50:48,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:50:48,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:50:48,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:50:48,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:50:48,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:50:47" (1/3) ... [2025-03-04 09:50:48,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580c485e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:50:48, skipping insertion in model container [2025-03-04 09:50:48,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:50:47" (2/3) ... [2025-03-04 09:50:48,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580c485e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:50:48, skipping insertion in model container [2025-03-04 09:50:48,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:50:48" (3/3) ... [2025-03-04 09:50:48,094 INFO L128 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2025-03-04 09:50:48,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:50:48,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix037.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:50:48,109 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:50:48,154 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:50:48,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-03-04 09:50:48,205 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-03-04 09:50:48,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:50:48,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-04 09:50:48,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-03-04 09:50:48,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-03-04 09:50:48,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:50:48,236 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;@68821198, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:50:48,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:50:48,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:50:48,247 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-04 09:50:48,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:50:48,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:48,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:50:48,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:50:48,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash -140837423, now seen corresponding path program 1 times [2025-03-04 09:50:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:48,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088787654] [2025-03-04 09:50:48,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:48,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:50:48,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:50:48,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:48,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:48,731 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-04 09:50:48,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:48,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088787654] [2025-03-04 09:50:48,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088787654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:48,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:48,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:50:48,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181792440] [2025-03-04 09:50:48,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:48,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:50:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:48,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:50:48,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:50:48,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-04 09:50:48,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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-04 09:50:48,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:48,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-04 09:50:48,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:50:52,957 INFO L124 PetriNetUnfolderBase]: 57803/76503 cut-off events. [2025-03-04 09:50:52,957 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-03-04 09:50:53,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152627 conditions, 76503 events. 57803/76503 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 2095. Compared 450079 event pairs, 6395 based on Foata normal form. 3456/79893 useless extension candidates. Maximal degree in co-relation 152615. Up to 66529 conditions per place. [2025-03-04 09:50:53,374 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 59 selfloop transitions, 2 changer transitions 2/71 dead transitions. [2025-03-04 09:50:53,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 280 flow [2025-03-04 09:50:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:50:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:50:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-04 09:50:53,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-03-04 09:50:53,385 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 104 transitions. [2025-03-04 09:50:53,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 280 flow [2025-03-04 09:50:53,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:50:53,393 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-03-04 09:50:53,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, 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-04 09:50:53,397 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-03-04 09:50:53,397 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-03-04 09:50:53,398 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-04 09:50:53,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:53,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:50:53,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:50:53,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:50:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash -354614089, now seen corresponding path program 1 times [2025-03-04 09:50:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524568662] [2025-03-04 09:50:53,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:53,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:53,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:50:53,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:50:53,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:53,457 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-04 09:50:53,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:53,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524568662] [2025-03-04 09:50:53,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524568662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:53,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:53,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:50:53,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442215284] [2025-03-04 09:50:53,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:53,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:50:53,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:53,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:50:53,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:50:53,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 09:50:53,461 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-04 09:50:53,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:53,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 09:50:53,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:50:56,927 INFO L124 PetriNetUnfolderBase]: 51971/71751 cut-off events. [2025-03-04 09:50:56,928 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2025-03-04 09:50:57,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142257 conditions, 71751 events. 51971/71751 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 2101. Compared 460880 event pairs, 51971 based on Foata normal form. 1728/73197 useless extension candidates. Maximal degree in co-relation 142247. Up to 68040 conditions per place. [2025-03-04 09:50:57,289 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 36 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-03-04 09:50:57,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 178 flow [2025-03-04 09:50:57,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:50:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:50:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 09:50:57,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-04 09:50:57,290 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 72 transitions. [2025-03-04 09:50:57,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 178 flow [2025-03-04 09:50:57,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:50:57,302 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-03-04 09:50:57,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, 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-04 09:50:57,302 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-04 09:50:57,303 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-03-04 09:50:57,303 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-04 09:50:57,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:50:57,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:50:57,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:50:57,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:50:57,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:50:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash -354613444, now seen corresponding path program 1 times [2025-03-04 09:50:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:50:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628840842] [2025-03-04 09:50:57,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:50:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:50:57,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:50:57,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:50:57,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:50:57,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:50:57,529 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-04 09:50:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:50:57,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628840842] [2025-03-04 09:50:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628840842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:50:57,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:50:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:50:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581995666] [2025-03-04 09:50:57,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:50:57,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:50:57,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:50:57,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:50:57,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:50:57,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 09:50:57,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-04 09:50:57,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:50:57,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 09:50:57,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:51:04,654 INFO L124 PetriNetUnfolderBase]: 110105/148557 cut-off events. [2025-03-04 09:51:04,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:51:05,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294453 conditions, 148557 events. 110105/148557 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4167. Compared 996531 event pairs, 32605 based on Foata normal form. 0/145596 useless extension candidates. Maximal degree in co-relation 294447. Up to 63707 conditions per place. [2025-03-04 09:51:05,555 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 62 selfloop transitions, 7 changer transitions 137/212 dead transitions. [2025-03-04 09:51:05,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 212 transitions, 850 flow [2025-03-04 09:51:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:51:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:51:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 307 transitions. [2025-03-04 09:51:05,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6202020202020202 [2025-03-04 09:51:05,557 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 9 states and 307 transitions. [2025-03-04 09:51:05,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 212 transitions, 850 flow [2025-03-04 09:51:05,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 212 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:51:05,561 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 193 flow [2025-03-04 09:51:05,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=193, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-03-04 09:51:05,562 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-03-04 09:51:05,562 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 193 flow [2025-03-04 09:51:05,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-04 09:51:05,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:51:05,562 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-04 09:51:05,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:51:05,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:51:05,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:51:05,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1438455643, now seen corresponding path program 1 times [2025-03-04 09:51:05,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:51:05,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548913623] [2025-03-04 09:51:05,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:51:05,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:51:05,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:51:05,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:51:05,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:51:05,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:51:05,699 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-04 09:51:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:51:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548913623] [2025-03-04 09:51:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548913623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:51:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:51:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:51:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896941580] [2025-03-04 09:51:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:51:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:51:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:51:05,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:51:05,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:51:05,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 09:51:05,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-04 09:51:05,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:51:05,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 09:51:05,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:51:12,225 INFO L124 PetriNetUnfolderBase]: 79623/109210 cut-off events. [2025-03-04 09:51:12,226 INFO L125 PetriNetUnfolderBase]: For 106692/106692 co-relation queries the response was YES. [2025-03-04 09:51:12,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293961 conditions, 109210 events. 79623/109210 cut-off events. For 106692/106692 co-relation queries the response was YES. Maximal size of possible extension queue 2867. Compared 712507 event pairs, 24247 based on Foata normal form. 2720/111871 useless extension candidates. Maximal degree in co-relation 293946. Up to 60681 conditions per place. [2025-03-04 09:51:12,869 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 62 selfloop transitions, 3 changer transitions 93/164 dead transitions. [2025-03-04 09:51:12,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 164 transitions, 997 flow [2025-03-04 09:51:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:51:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:51:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2025-03-04 09:51:12,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5506493506493506 [2025-03-04 09:51:12,871 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 193 flow. Second operand 7 states and 212 transitions. [2025-03-04 09:51:12,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 164 transitions, 997 flow [2025-03-04 09:51:14,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 164 transitions, 877 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-03-04 09:51:14,264 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 182 flow [2025-03-04 09:51:14,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-03-04 09:51:14,264 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-03-04 09:51:14,264 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 182 flow [2025-03-04 09:51:14,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-04 09:51:14,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:51:14,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:51:14,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:51:14,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:51:14,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:51:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1865779289, now seen corresponding path program 1 times [2025-03-04 09:51:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:51:14,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354019409] [2025-03-04 09:51:14,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:51:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:51:14,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:51:14,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:51:14,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:51:14,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:51:14,432 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-04 09:51:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:51:14,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354019409] [2025-03-04 09:51:14,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354019409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:51:14,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:51:14,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:51:14,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782575785] [2025-03-04 09:51:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:51:14,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:51:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:51:14,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:51:14,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:51:14,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-04 09:51:14,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-04 09:51:14,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:51:14,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-04 09:51:14,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand