./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix021.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix021.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:40:34,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:40:34,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:40:34,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:40:34,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:40:34,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:40:34,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:40:34,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:40:34,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:40:34,450 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:40:34,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:40:34,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:40:34,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:40:34,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:40:34,450 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:40:34,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:40:34,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:40:34,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:40:34,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:40:34,452 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db [2025-02-06 12:40:34,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:40:34,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:40:34,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:40:34,681 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:40:34,681 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:40:34,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021.opt.i [2025-02-06 12:40:35,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31912dd64/40eb7c83ab934ee38af948585d2ad09d/FLAG51105b380 [2025-02-06 12:40:36,158 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:40:36,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021.opt.i [2025-02-06 12:40:36,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31912dd64/40eb7c83ab934ee38af948585d2ad09d/FLAG51105b380 [2025-02-06 12:40:36,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31912dd64/40eb7c83ab934ee38af948585d2ad09d [2025-02-06 12:40:36,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:40:36,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:40:36,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:40:36,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:40:36,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:40:36,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:36,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5766f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36, skipping insertion in model container [2025-02-06 12:40:36,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:36,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:40:36,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:40:36,850 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:40:36,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:40:36,957 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:40:36,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36 WrapperNode [2025-02-06 12:40:36,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:40:36,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:40:36,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:40:36,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:40:36,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:36,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,009 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2025-02-06 12:40:37,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:40:37,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:40:37,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:40:37,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:40:37,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,046 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:40:37,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:40:37,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:40:37,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:40:37,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:40:37,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (1/1) ... [2025-02-06 12:40:37,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:40:37,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:40:37,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:40:37,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:40:37,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:40:37,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:40:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:40:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:40:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:40:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:40:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:40:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:40:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-06 12:40:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-06 12:40:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:40:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:40:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:40:37,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:40:37,132 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:40:37,257 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:40:37,259 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:40:37,496 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:40:37,496 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:40:37,683 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:40:37,684 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:40:37,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:37 BoogieIcfgContainer [2025-02-06 12:40:37,684 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:40:37,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:40:37,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:40:37,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:40:37,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:40:36" (1/3) ... [2025-02-06 12:40:37,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1bcc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:40:37, skipping insertion in model container [2025-02-06 12:40:37,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:36" (2/3) ... [2025-02-06 12:40:37,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1bcc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:40:37, skipping insertion in model container [2025-02-06 12:40:37,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:37" (3/3) ... [2025-02-06 12:40:37,698 INFO L128 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2025-02-06 12:40:37,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:40:37,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix021.opt.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:40:37,711 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:40:37,760 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:40:37,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2025-02-06 12:40:37,806 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-02-06 12:40:37,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:40:37,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2025-02-06 12:40:37,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2025-02-06 12:40:37,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2025-02-06 12:40:37,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:40:37,826 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;@7d0896cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:40:37,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:40:37,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:40:37,833 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-06 12:40:37,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:40:37,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:37,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:40:37,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:37,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash -193010036, now seen corresponding path program 1 times [2025-02-06 12:40:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:37,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392949868] [2025-02-06 12:40:37,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:37,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:40:37,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:40:37,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:37,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:38,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392949868] [2025-02-06 12:40:38,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392949868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:38,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:38,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:40:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320916054] [2025-02-06 12:40:38,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:38,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:40:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:38,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:40:38,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:40:38,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-02-06 12:40:38,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:38,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:38,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-02-06 12:40:38,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:42,695 INFO L124 PetriNetUnfolderBase]: 50459/66999 cut-off events. [2025-02-06 12:40:42,695 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-02-06 12:40:42,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133619 conditions, 66999 events. 50459/66999 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 1891. Compared 396309 event pairs, 6395 based on Foata normal form. 3024/69996 useless extension candidates. Maximal degree in co-relation 133607. Up to 57025 conditions per place. [2025-02-06 12:40:43,116 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 58 selfloop transitions, 2 changer transitions 2/70 dead transitions. [2025-02-06 12:40:43,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 276 flow [2025-02-06 12:40:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:40:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:40:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-02-06 12:40:43,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2025-02-06 12:40:43,134 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 103 transitions. [2025-02-06 12:40:43,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 276 flow [2025-02-06 12:40:43,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:40:43,157 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2025-02-06 12:40:43,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-02-06 12:40:43,166 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2025-02-06 12:40:43,171 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2025-02-06 12:40:43,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:43,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:43,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:40:43,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:40:43,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:43,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash -679987065, now seen corresponding path program 1 times [2025-02-06 12:40:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:43,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399732113] [2025-02-06 12:40:43,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:43,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:40:43,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:40:43,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:43,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399732113] [2025-02-06 12:40:43,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399732113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:43,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:43,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:40:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818136224] [2025-02-06 12:40:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:43,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:40:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:43,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:40:43,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:40:43,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:40:43,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:43,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:43,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:40:43,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:46,655 INFO L124 PetriNetUnfolderBase]: 45383/63867 cut-off events. [2025-02-06 12:40:46,658 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2025-02-06 12:40:46,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125841 conditions, 63867 events. 45383/63867 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 1912. Compared 421164 event pairs, 45383 based on Foata normal form. 1512/65136 useless extension candidates. Maximal degree in co-relation 125831. Up to 59508 conditions per place. [2025-02-06 12:40:47,188 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 35 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2025-02-06 12:40:47,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 174 flow [2025-02-06 12:40:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:40:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:40:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-02-06 12:40:47,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2025-02-06 12:40:47,191 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 71 transitions. [2025-02-06 12:40:47,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 174 flow [2025-02-06 12:40:47,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:40:47,203 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2025-02-06 12:40:47,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-02-06 12:40:47,204 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2025-02-06 12:40:47,204 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2025-02-06 12:40:47,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:47,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:47,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:40:47,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:40:47,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:47,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash -679986343, now seen corresponding path program 1 times [2025-02-06 12:40:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582015593] [2025-02-06 12:40:47,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:47,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:40:47,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:40:47,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:47,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582015593] [2025-02-06 12:40:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582015593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:47,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:40:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395783373] [2025-02-06 12:40:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:40:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:47,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:40:47,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:40:47,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:40:47,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 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-02-06 12:40:47,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:47,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:40:47,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:56,208 INFO L124 PetriNetUnfolderBase]: 108211/145598 cut-off events. [2025-02-06 12:40:56,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:40:56,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289072 conditions, 145598 events. 108211/145598 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4219. Compared 965170 event pairs, 26919 based on Foata normal form. 0/142749 useless extension candidates. Maximal degree in co-relation 289066. Up to 54443 conditions per place. [2025-02-06 12:40:56,937 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 59 selfloop transitions, 8 changer transitions 133/206 dead transitions. [2025-02-06 12:40:56,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 206 transitions, 826 flow [2025-02-06 12:40:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:40:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:40:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 301 transitions. [2025-02-06 12:40:56,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6193415637860082 [2025-02-06 12:40:56,940 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 9 states and 301 transitions. [2025-02-06 12:40:56,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 206 transitions, 826 flow [2025-02-06 12:40:56,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 206 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:40:56,945 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 205 flow [2025-02-06 12:40:56,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=205, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-02-06 12:40:56,946 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2025-02-06 12:40:56,946 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 205 flow [2025-02-06 12:40:56,946 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-02-06 12:40:56,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:56,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:40:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:40:56,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1615271560, now seen corresponding path program 1 times [2025-02-06 12:40:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907061243] [2025-02-06 12:40:56,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:56,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:40:56,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:40:56,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:56,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:57,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:57,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907061243] [2025-02-06 12:40:57,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907061243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:57,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:57,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:40:57,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665754587] [2025-02-06 12:40:57,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:57,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:40:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:57,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:40:57,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:40:57,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:40:57,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:57,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:57,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:40:57,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:05,837 INFO L124 PetriNetUnfolderBase]: 85507/116254 cut-off events. [2025-02-06 12:41:05,838 INFO L125 PetriNetUnfolderBase]: For 150354/150354 co-relation queries the response was YES. [2025-02-06 12:41:06,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331417 conditions, 116254 events. 85507/116254 cut-off events. For 150354/150354 co-relation queries the response was YES. Maximal size of possible extension queue 3404. Compared 779741 event pairs, 5515 based on Foata normal form. 2688/118930 useless extension candidates. Maximal degree in co-relation 331402. Up to 51705 conditions per place. [2025-02-06 12:41:06,663 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 81 selfloop transitions, 12 changer transitions 126/225 dead transitions. [2025-02-06 12:41:06,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 225 transitions, 1391 flow [2025-02-06 12:41:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:41:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:41:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 316 transitions. [2025-02-06 12:41:06,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2025-02-06 12:41:06,665 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 205 flow. Second operand 10 states and 316 transitions. [2025-02-06 12:41:06,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 225 transitions, 1391 flow [2025-02-06 12:41:07,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 225 transitions, 1237 flow, removed 37 selfloop flow, removed 4 redundant places. [2025-02-06 12:41:07,330 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 313 flow [2025-02-06 12:41:07,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=313, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2025-02-06 12:41:07,331 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2025-02-06 12:41:07,332 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 313 flow [2025-02-06 12:41:07,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:07,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:07,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:07,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:41:07,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:41:07,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash -413441864, now seen corresponding path program 1 times [2025-02-06 12:41:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333241397] [2025-02-06 12:41:07,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:07,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:41:07,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:41:07,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:07,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:07,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333241397] [2025-02-06 12:41:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333241397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:07,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:07,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:41:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778500390] [2025-02-06 12:41:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:07,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:41:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:07,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:41:07,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:41:07,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:41:07,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:07,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:07,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:41:07,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand