./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe035_power.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/safe035_power.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 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:51:39,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:51:39,254 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:51:39,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:51:39,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:51:39,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:51:39,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:51:39,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:51:39,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:51:39,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:51:39,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:51:39,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:51:39,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:51:39,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:51:39,291 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:51:39,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:51:39,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:51:39,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:51:39,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:51:39,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:51:39,292 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:51:39,293 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:51:39,293 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:51:39,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:51:39,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:51:39,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:51:39,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:51:39,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:51:39,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:51:39,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:51:39,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:51:39,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:51:39,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:51:39,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:51:39,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:51:39,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:51:39,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:51:39,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:51:39,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:51:39,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:51:39,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:51:39,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:51:39,295 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 -> 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 [2025-02-06 12:51:39,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:51:39,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:51:39,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:51:39,577 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:51:39,577 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:51:39,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe035_power.i [2025-02-06 12:51:40,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30a15c9ea/494bb511f03d4746a9d42940c6768522/FLAG75bce3cf7 [2025-02-06 12:51:41,190 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:51:41,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe035_power.i [2025-02-06 12:51:41,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30a15c9ea/494bb511f03d4746a9d42940c6768522/FLAG75bce3cf7 [2025-02-06 12:51:41,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30a15c9ea/494bb511f03d4746a9d42940c6768522 [2025-02-06 12:51:41,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:51:41,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:51:41,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:51:41,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:51:41,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:51:41,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f915dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41, skipping insertion in model container [2025-02-06 12:51:41,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:51:41,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:51:41,723 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:51:41,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:51:41,850 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:51:41,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41 WrapperNode [2025-02-06 12:51:41,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:51:41,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:51:41,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:51:41,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:51:41,860 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:51:41" (1/1) ... [2025-02-06 12:51:41,875 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:51:41" (1/1) ... [2025-02-06 12:51:41,918 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2025-02-06 12:51:41,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:51:41,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:51:41,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:51:41,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:51:41,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,967 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:51:41,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:41,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:51:41,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:51:41,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:51:41,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:51:42,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (1/1) ... [2025-02-06 12:51:42,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:51:42,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:42,040 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:51:42,044 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:51:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:51:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:51:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:51:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:51:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:51:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:51:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:51:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:51:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:51:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:51:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:51:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:51:42,071 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:51:42,208 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:51:42,211 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:51:42,620 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:51:42,620 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:51:42,971 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:51:42,973 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:51:42,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:42 BoogieIcfgContainer [2025-02-06 12:51:42,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:51:42,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:51:42,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:51:42,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:51:42,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:51:41" (1/3) ... [2025-02-06 12:51:42,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160e7e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:51:42, skipping insertion in model container [2025-02-06 12:51:42,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:41" (2/3) ... [2025-02-06 12:51:42,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160e7e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:51:42, skipping insertion in model container [2025-02-06 12:51:42,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:42" (3/3) ... [2025-02-06 12:51:42,984 INFO L128 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2025-02-06 12:51:42,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:51:43,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe035_power.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:51:43,001 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:51:43,077 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:51:43,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2025-02-06 12:51:43,149 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2025-02-06 12:51:43,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:43,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-02-06 12:51:43,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2025-02-06 12:51:43,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2025-02-06 12:51:43,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:51:43,188 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;@7ffc40d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:51:43,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:51:43,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:51:43,201 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-02-06 12:51:43,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:43,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:43,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:43,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:51:43,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 812206966, now seen corresponding path program 1 times [2025-02-06 12:51:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366892416] [2025-02-06 12:51:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:43,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:51:43,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:51:43,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:43,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:43,737 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:51:43,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366892416] [2025-02-06 12:51:43,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366892416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:43,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:43,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:51:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984274887] [2025-02-06 12:51:43,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:43,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:51:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:43,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:51:43,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:51:43,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:51:43,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:51:43,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:43,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:51:43,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:45,823 INFO L124 PetriNetUnfolderBase]: 8658/12406 cut-off events. [2025-02-06 12:51:45,823 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-06 12:51:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24726 conditions, 12406 events. 8658/12406 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 69086 event pairs, 972 based on Foata normal form. 686/13081 useless extension candidates. Maximal degree in co-relation 24715. Up to 10627 conditions per place. [2025-02-06 12:51:45,922 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 50 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2025-02-06 12:51:45,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 239 flow [2025-02-06 12:51:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:51:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:51:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-06 12:51:45,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2025-02-06 12:51:45,939 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 89 transitions. [2025-02-06 12:51:45,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 239 flow [2025-02-06 12:51:45,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:51:45,949 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2025-02-06 12:51:45,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-02-06 12:51:45,957 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-02-06 12:51:45,958 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2025-02-06 12:51:45,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:51:45,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:45,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:45,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:51:45,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:51:45,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1141359809, now seen corresponding path program 1 times [2025-02-06 12:51:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:45,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835931813] [2025-02-06 12:51:45,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:45,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:51:46,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:51:46,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:46,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:46,149 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:51:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:46,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835931813] [2025-02-06 12:51:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835931813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:46,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:46,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:51:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598922085] [2025-02-06 12:51:46,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:46,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:51:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:46,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:51:46,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:51:46,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-06 12:51:46,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:51:46,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:46,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-06 12:51:46,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:47,665 INFO L124 PetriNetUnfolderBase]: 7776/11818 cut-off events. [2025-02-06 12:51:47,665 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2025-02-06 12:51:47,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23353 conditions, 11818 events. 7776/11818 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 71416 event pairs, 7776 based on Foata normal form. 343/12101 useless extension candidates. Maximal degree in co-relation 23343. Up to 10976 conditions per place. [2025-02-06 12:51:47,741 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 30 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2025-02-06 12:51:47,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 150 flow [2025-02-06 12:51:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:51:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:51:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-06 12:51:47,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2025-02-06 12:51:47,743 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 60 transitions. [2025-02-06 12:51:47,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 150 flow [2025-02-06 12:51:47,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:51:47,748 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2025-02-06 12:51:47,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-02-06 12:51:47,749 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-02-06 12:51:47,749 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2025-02-06 12:51:47,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:51:47,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:47,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:47,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:51:47,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:51:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1141359401, now seen corresponding path program 1 times [2025-02-06 12:51:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:47,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954526941] [2025-02-06 12:51:47,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:47,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:51:47,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:51:47,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:47,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:48,092 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:51:48,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:48,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954526941] [2025-02-06 12:51:48,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954526941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:48,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:48,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:51:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107782558] [2025-02-06 12:51:48,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:48,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:51:48,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:48,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:51:48,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:51:48,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:51:48,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:51:48,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:48,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:51:48,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:49,151 INFO L124 PetriNetUnfolderBase]: 5308/8421 cut-off events. [2025-02-06 12:51:49,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:49,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16297 conditions, 8421 events. 5308/8421 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 51063 event pairs, 994 based on Foata normal form. 343/8753 useless extension candidates. Maximal degree in co-relation 16291. Up to 4351 conditions per place. [2025-02-06 12:51:49,191 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 64 selfloop transitions, 5 changer transitions 1/76 dead transitions. [2025-02-06 12:51:49,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 304 flow [2025-02-06 12:51:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:51:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:51:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-06 12:51:49,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-02-06 12:51:49,196 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 4 states and 112 transitions. [2025-02-06 12:51:49,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 304 flow [2025-02-06 12:51:49,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:51:49,199 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow [2025-02-06 12:51:49,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-02-06 12:51:49,201 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-02-06 12:51:49,201 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow [2025-02-06 12:51:49,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:51:49,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:49,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:49,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:51:49,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:51:49,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2055532008, now seen corresponding path program 1 times [2025-02-06 12:51:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:49,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619738743] [2025-02-06 12:51:49,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:49,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:51:49,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:51:49,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:49,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:49,613 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:51:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:49,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619738743] [2025-02-06 12:51:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619738743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:49,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:49,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:51:49,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445664175] [2025-02-06 12:51:49,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:49,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:51:49,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:49,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:51:49,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:51:49,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:51:49,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:51:49,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:49,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:51:49,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:50,454 INFO L124 PetriNetUnfolderBase]: 2833/4471 cut-off events. [2025-02-06 12:51:50,455 INFO L125 PetriNetUnfolderBase]: For 777/777 co-relation queries the response was YES. [2025-02-06 12:51:50,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10062 conditions, 4471 events. 2833/4471 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 23069 event pairs, 651 based on Foata normal form. 218/4678 useless extension candidates. Maximal degree in co-relation 10053. Up to 1515 conditions per place. [2025-02-06 12:51:50,496 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 82 selfloop transitions, 8 changer transitions 1/97 dead transitions. [2025-02-06 12:51:50,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 97 transitions, 432 flow [2025-02-06 12:51:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:51:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:51:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-02-06 12:51:50,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6085106382978723 [2025-02-06 12:51:50,499 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 143 transitions. [2025-02-06 12:51:50,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 97 transitions, 432 flow [2025-02-06 12:51:50,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:51:50,504 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow [2025-02-06 12:51:50,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-02-06 12:51:50,505 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-02-06 12:51:50,505 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow [2025-02-06 12:51:50,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:51:50,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:50,505 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, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:51:50,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:51:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -966217367, now seen corresponding path program 1 times [2025-02-06 12:51:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717631017] [2025-02-06 12:51:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:50,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:51:50,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:51:50,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:50,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:51,102 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:51:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717631017] [2025-02-06 12:51:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717631017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:51,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:51:51,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785334171] [2025-02-06 12:51:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:51,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:51:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:51,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:51:51,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:51:51,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:51:51,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:51:51,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:51,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:51:51,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:51,639 INFO L124 PetriNetUnfolderBase]: 1798/2746 cut-off events. [2025-02-06 12:51:51,639 INFO L125 PetriNetUnfolderBase]: For 1462/1462 co-relation queries the response was YES. [2025-02-06 12:51:51,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6714 conditions, 2746 events. 1798/2746 cut-off events. For 1462/1462 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12496 event pairs, 594 based on Foata normal form. 68/2803 useless extension candidates. Maximal degree in co-relation 6703. Up to 1050 conditions per place. [2025-02-06 12:51:51,653 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 68 selfloop transitions, 11 changer transitions 1/86 dead transitions. [2025-02-06 12:51:51,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 411 flow [2025-02-06 12:51:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:51:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:51:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-02-06 12:51:51,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2025-02-06 12:51:51,657 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 142 transitions. [2025-02-06 12:51:51,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 411 flow [2025-02-06 12:51:51,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 386 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:51:51,673 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow [2025-02-06 12:51:51,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-02-06 12:51:51,674 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-02-06 12:51:51,674 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow [2025-02-06 12:51:51,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:51:51,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:51,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:51,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:51:51,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:51:51,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash -743451829, now seen corresponding path program 1 times [2025-02-06 12:51:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:51,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756013639] [2025-02-06 12:51:51,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:51,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:51,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:51:51,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:51:51,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:51,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:56,985 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:51:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756013639] [2025-02-06 12:51:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756013639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:56,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:56,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:51:56,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687420052] [2025-02-06 12:51:56,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:56,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:51:56,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:56,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:51:56,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:51:57,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:51:57,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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:51:57,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:57,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:51:57,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:58,463 INFO L124 PetriNetUnfolderBase]: 2969/4516 cut-off events. [2025-02-06 12:51:58,464 INFO L125 PetriNetUnfolderBase]: For 2884/2884 co-relation queries the response was YES. [2025-02-06 12:51:58,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11170 conditions, 4516 events. 2969/4516 cut-off events. For 2884/2884 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 22275 event pairs, 126 based on Foata normal form. 8/4517 useless extension candidates. Maximal degree in co-relation 11158. Up to 2011 conditions per place. [2025-02-06 12:51:58,493 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 70 selfloop transitions, 5 changer transitions 91/172 dead transitions. [2025-02-06 12:51:58,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 172 transitions, 991 flow [2025-02-06 12:51:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:51:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 12:51:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 273 transitions. [2025-02-06 12:51:58,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2025-02-06 12:51:58,496 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 13 states and 273 transitions. [2025-02-06 12:51:58,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 172 transitions, 991 flow [2025-02-06 12:51:58,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 172 transitions, 778 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:51:58,512 INFO L231 Difference]: Finished difference. Result has 71 places, 46 transitions, 168 flow [2025-02-06 12:51:58,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=46} [2025-02-06 12:51:58,513 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-02-06 12:51:58,513 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 46 transitions, 168 flow [2025-02-06 12:51:58,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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:51:58,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:58,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:58,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:51:58,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:51:58,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash -493738033, now seen corresponding path program 2 times [2025-02-06 12:51:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:58,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774240990] [2025-02-06 12:51:58,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:51:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:58,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:51:58,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:51:58,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:51:58,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:00,709 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:52:00,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774240990] [2025-02-06 12:52:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774240990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:52:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939863941] [2025-02-06 12:52:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:00,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:52:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:00,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:52:00,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:52:00,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:52:00,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 46 transitions, 168 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:52:00,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:00,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:52:00,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:01,587 INFO L124 PetriNetUnfolderBase]: 2474/3801 cut-off events. [2025-02-06 12:52:01,588 INFO L125 PetriNetUnfolderBase]: For 2557/2557 co-relation queries the response was YES. [2025-02-06 12:52:01,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10514 conditions, 3801 events. 2474/3801 cut-off events. For 2557/2557 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18131 event pairs, 394 based on Foata normal form. 8/3805 useless extension candidates. Maximal degree in co-relation 10496. Up to 2235 conditions per place. [2025-02-06 12:52:01,611 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 58 selfloop transitions, 6 changer transitions 45/115 dead transitions. [2025-02-06 12:52:01,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 115 transitions, 623 flow [2025-02-06 12:52:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:52:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:52:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2025-02-06 12:52:01,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4601063829787234 [2025-02-06 12:52:01,613 INFO L175 Difference]: Start difference. First operand has 71 places, 46 transitions, 168 flow. Second operand 8 states and 173 transitions. [2025-02-06 12:52:01,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 115 transitions, 623 flow [2025-02-06 12:52:01,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 115 transitions, 604 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 12:52:01,630 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 196 flow [2025-02-06 12:52:01,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=196, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-02-06 12:52:01,631 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-02-06 12:52:01,632 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 196 flow [2025-02-06 12:52:01,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:52:01,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:01,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:01,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:52:01,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:52:01,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1040376333, now seen corresponding path program 3 times [2025-02-06 12:52:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:01,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133345670] [2025-02-06 12:52:01,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:52:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:01,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:52:01,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:52:01,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:52:01,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:02,107 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:52:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133345670] [2025-02-06 12:52:02,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133345670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:02,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:02,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:52:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759080709] [2025-02-06 12:52:02,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:02,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:52:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:02,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:52:02,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:52:02,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:52:02,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:52:02,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:02,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:52:02,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:02,708 INFO L124 PetriNetUnfolderBase]: 2298/3531 cut-off events. [2025-02-06 12:52:02,708 INFO L125 PetriNetUnfolderBase]: For 2404/2404 co-relation queries the response was YES. [2025-02-06 12:52:02,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9893 conditions, 3531 events. 2298/3531 cut-off events. For 2404/2404 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 16599 event pairs, 556 based on Foata normal form. 8/3532 useless extension candidates. Maximal degree in co-relation 9874. Up to 2210 conditions per place. [2025-02-06 12:52:02,735 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 53 selfloop transitions, 2 changer transitions 36/97 dead transitions. [2025-02-06 12:52:02,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 545 flow [2025-02-06 12:52:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:52:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:52:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-02-06 12:52:02,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2025-02-06 12:52:02,737 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 196 flow. Second operand 6 states and 132 transitions. [2025-02-06 12:52:02,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 545 flow [2025-02-06 12:52:02,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 97 transitions, 530 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 12:52:02,742 INFO L231 Difference]: Finished difference. Result has 70 places, 48 transitions, 191 flow [2025-02-06 12:52:02,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=70, PETRI_TRANSITIONS=48} [2025-02-06 12:52:02,745 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2025-02-06 12:52:02,745 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 191 flow [2025-02-06 12:52:02,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:52:02,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:02,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:02,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:52:02,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:52:02,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1088511547, now seen corresponding path program 4 times [2025-02-06 12:52:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:02,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393640604] [2025-02-06 12:52:02,747 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:52:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:02,767 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-06 12:52:02,978 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:52:02,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:52:02,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:05,905 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:52:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:05,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393640604] [2025-02-06 12:52:05,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393640604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:05,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:05,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:52:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807654070] [2025-02-06 12:52:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:05,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:52:05,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:05,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:52:05,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:52:05,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:52:05,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 48 transitions, 191 flow. Second operand has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 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:52:05,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:05,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:52:05,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:07,027 INFO L124 PetriNetUnfolderBase]: 3007/4656 cut-off events. [2025-02-06 12:52:07,027 INFO L125 PetriNetUnfolderBase]: For 3899/3899 co-relation queries the response was YES. [2025-02-06 12:52:07,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12912 conditions, 4656 events. 3007/4656 cut-off events. For 3899/3899 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 24133 event pairs, 356 based on Foata normal form. 8/4661 useless extension candidates. Maximal degree in co-relation 12892. Up to 1804 conditions per place. [2025-02-06 12:52:07,059 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 59 selfloop transitions, 11 changer transitions 60/136 dead transitions. [2025-02-06 12:52:07,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 136 transitions, 788 flow [2025-02-06 12:52:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:52:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:52:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2025-02-06 12:52:07,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47754137115839246 [2025-02-06 12:52:07,063 INFO L175 Difference]: Start difference. First operand has 70 places, 48 transitions, 191 flow. Second operand 9 states and 202 transitions. [2025-02-06 12:52:07,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 136 transitions, 788 flow [2025-02-06 12:52:07,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 136 transitions, 759 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-02-06 12:52:07,071 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 264 flow [2025-02-06 12:52:07,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2025-02-06 12:52:07,072 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-02-06 12:52:07,072 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 264 flow [2025-02-06 12:52:07,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 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:52:07,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:07,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:07,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:52:07,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:52:07,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1444182941, now seen corresponding path program 5 times [2025-02-06 12:52:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:07,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399334204] [2025-02-06 12:52:07,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:52:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:07,089 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:52:07,230 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:52:07,230 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:52:07,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:08,391 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:52:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399334204] [2025-02-06 12:52:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399334204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:08,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:08,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:52:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787730940] [2025-02-06 12:52:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:08,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:52:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:08,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:52:08,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:52:08,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:52:08,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 264 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:52:08,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:08,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:52:08,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:09,424 INFO L124 PetriNetUnfolderBase]: 4130/6601 cut-off events. [2025-02-06 12:52:09,424 INFO L125 PetriNetUnfolderBase]: For 8347/8347 co-relation queries the response was YES. [2025-02-06 12:52:09,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20550 conditions, 6601 events. 4130/6601 cut-off events. For 8347/8347 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 38374 event pairs, 1106 based on Foata normal form. 8/6606 useless extension candidates. Maximal degree in co-relation 20528. Up to 2683 conditions per place. [2025-02-06 12:52:09,450 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 51 selfloop transitions, 10 changer transitions 75/142 dead transitions. [2025-02-06 12:52:09,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 142 transitions, 911 flow [2025-02-06 12:52:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:52:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:52:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2025-02-06 12:52:09,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4515366430260047 [2025-02-06 12:52:09,452 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 264 flow. Second operand 9 states and 191 transitions. [2025-02-06 12:52:09,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 142 transitions, 911 flow [2025-02-06 12:52:09,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 142 transitions, 875 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 12:52:09,465 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 279 flow [2025-02-06 12:52:09,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=279, PETRI_PLACES=80, PETRI_TRANSITIONS=54} [2025-02-06 12:52:09,466 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2025-02-06 12:52:09,466 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 279 flow [2025-02-06 12:52:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:52:09,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:09,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:09,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:52:09,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:52:09,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash -757004621, now seen corresponding path program 6 times [2025-02-06 12:52:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526716338] [2025-02-06 12:52:09,468 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 12:52:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:09,479 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:52:09,625 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:52:09,625 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 12:52:09,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:10,978 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:52:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526716338] [2025-02-06 12:52:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526716338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:10,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:52:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516420456] [2025-02-06 12:52:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:10,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:52:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:10,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:52:10,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:52:10,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:52:10,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 54 transitions, 279 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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:52:10,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:10,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:52:10,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:11,960 INFO L124 PetriNetUnfolderBase]: 2191/3537 cut-off events. [2025-02-06 12:52:11,961 INFO L125 PetriNetUnfolderBase]: For 6625/6625 co-relation queries the response was YES. [2025-02-06 12:52:11,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12155 conditions, 3537 events. 2191/3537 cut-off events. For 6625/6625 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18233 event pairs, 897 based on Foata normal form. 8/3536 useless extension candidates. Maximal degree in co-relation 12131. Up to 1880 conditions per place. [2025-02-06 12:52:11,977 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 54 selfloop transitions, 10 changer transitions 51/121 dead transitions. [2025-02-06 12:52:11,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 825 flow [2025-02-06 12:52:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:52:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:52:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2025-02-06 12:52:11,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4302600472813239 [2025-02-06 12:52:11,980 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 279 flow. Second operand 9 states and 182 transitions. [2025-02-06 12:52:11,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 825 flow [2025-02-06 12:52:11,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 743 flow, removed 33 selfloop flow, removed 9 redundant places. [2025-02-06 12:52:11,998 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 296 flow [2025-02-06 12:52:11,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2025-02-06 12:52:12,000 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2025-02-06 12:52:12,000 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 296 flow [2025-02-06 12:52:12,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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:52:12,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:12,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:12,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:52:12,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:52:12,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 559384405, now seen corresponding path program 7 times [2025-02-06 12:52:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679529281] [2025-02-06 12:52:12,002 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 12:52:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:52:12,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:52:12,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:52:12,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:14,553 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:52:14,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:14,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679529281] [2025-02-06 12:52:14,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679529281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:14,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:14,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:52:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282391555] [2025-02-06 12:52:14,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:14,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:52:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:14,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:52:14,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:52:14,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:52:14,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 296 flow. Second operand has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 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:52:14,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:14,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:52:14,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:15,436 INFO L124 PetriNetUnfolderBase]: 2065/3363 cut-off events. [2025-02-06 12:52:15,436 INFO L125 PetriNetUnfolderBase]: For 6574/6574 co-relation queries the response was YES. [2025-02-06 12:52:15,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11327 conditions, 3363 events. 2065/3363 cut-off events. For 6574/6574 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17303 event pairs, 642 based on Foata normal form. 8/3362 useless extension candidates. Maximal degree in co-relation 11305. Up to 1385 conditions per place. [2025-02-06 12:52:15,448 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 38 selfloop transitions, 4 changer transitions 75/123 dead transitions. [2025-02-06 12:52:15,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 123 transitions, 835 flow [2025-02-06 12:52:15,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:52:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:52:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2025-02-06 12:52:15,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4654255319148936 [2025-02-06 12:52:15,449 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 296 flow. Second operand 8 states and 175 transitions. [2025-02-06 12:52:15,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 123 transitions, 835 flow [2025-02-06 12:52:15,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 123 transitions, 793 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-02-06 12:52:15,459 INFO L231 Difference]: Finished difference. Result has 79 places, 45 transitions, 207 flow [2025-02-06 12:52:15,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=79, PETRI_TRANSITIONS=45} [2025-02-06 12:52:15,459 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2025-02-06 12:52:15,459 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 45 transitions, 207 flow [2025-02-06 12:52:15,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 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:52:15,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:15,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:15,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:52:15,460 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:52:15,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1505278775, now seen corresponding path program 8 times [2025-02-06 12:52:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:15,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534846554] [2025-02-06 12:52:15,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:52:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:15,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:52:15,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:52:15,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:52:15,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:17,259 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:52:17,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534846554] [2025-02-06 12:52:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534846554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:52:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170074047] [2025-02-06 12:52:17,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:17,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:52:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:17,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:52:17,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:52:17,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:52:17,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 45 transitions, 207 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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:52:17,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:17,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:52:17,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:17,663 INFO L124 PetriNetUnfolderBase]: 1291/2087 cut-off events. [2025-02-06 12:52:17,663 INFO L125 PetriNetUnfolderBase]: For 2914/2914 co-relation queries the response was YES. [2025-02-06 12:52:17,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6641 conditions, 2087 events. 1291/2087 cut-off events. For 2914/2914 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9572 event pairs, 352 based on Foata normal form. 8/2094 useless extension candidates. Maximal degree in co-relation 6619. Up to 1485 conditions per place. [2025-02-06 12:52:17,672 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 48 selfloop transitions, 5 changer transitions 16/75 dead transitions. [2025-02-06 12:52:17,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 462 flow [2025-02-06 12:52:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:52:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:52:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2025-02-06 12:52:17,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3829787234042553 [2025-02-06 12:52:17,673 INFO L175 Difference]: Start difference. First operand has 79 places, 45 transitions, 207 flow. Second operand 7 states and 126 transitions. [2025-02-06 12:52:17,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 462 flow [2025-02-06 12:52:17,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 411 flow, removed 11 selfloop flow, removed 15 redundant places. [2025-02-06 12:52:17,676 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 214 flow [2025-02-06 12:52:17,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2025-02-06 12:52:17,676 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2025-02-06 12:52:17,676 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 214 flow [2025-02-06 12:52:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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:52:17,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:52:17,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:52:17,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:52:17,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:52:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:52:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1729297065, now seen corresponding path program 9 times [2025-02-06 12:52:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:52:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572170908] [2025-02-06 12:52:17,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:52:17,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:52:17,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:52:17,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:52:17,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:52:17,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:52:19,946 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:52:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:52:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572170908] [2025-02-06 12:52:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572170908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:52:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:52:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:52:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485838598] [2025-02-06 12:52:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:52:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:52:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:52:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:52:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:52:19,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-06 12:52:19,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 214 flow. Second operand has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 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:52:19,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:52:19,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-06 12:52:19,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:52:20,499 INFO L124 PetriNetUnfolderBase]: 1107/1791 cut-off events. [2025-02-06 12:52:20,499 INFO L125 PetriNetUnfolderBase]: For 2828/2828 co-relation queries the response was YES. [2025-02-06 12:52:20,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5804 conditions, 1791 events. 1107/1791 cut-off events. For 2828/2828 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7828 event pairs, 302 based on Foata normal form. 8/1798 useless extension candidates. Maximal degree in co-relation 5792. Up to 1050 conditions per place. [2025-02-06 12:52:20,504 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 0 selfloop transitions, 0 changer transitions 71/71 dead transitions. [2025-02-06 12:52:20,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 445 flow [2025-02-06 12:52:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:52:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:52:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2025-02-06 12:52:20,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34515366430260047 [2025-02-06 12:52:20,506 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 214 flow. Second operand 9 states and 146 transitions. [2025-02-06 12:52:20,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 445 flow [2025-02-06 12:52:20,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 429 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:52:20,509 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2025-02-06 12:52:20,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2025-02-06 12:52:20,510 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-02-06 12:52:20,510 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2025-02-06 12:52:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 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:52:20,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:52:20,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:52:20,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:52:20,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:52:20,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:52:20,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:52:20,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:52:20,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:52:20,515 INFO L422 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1] [2025-02-06 12:52:20,520 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:52:20,520 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:52:20,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:52:20 BasicIcfg [2025-02-06 12:52:20,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:52:20,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:52:20,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:52:20,528 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:52:20,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:42" (3/4) ... [2025-02-06 12:52:20,531 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 12:52:20,534 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-02-06 12:52:20,534 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-02-06 12:52:20,534 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-02-06 12:52:20,539 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2025-02-06 12:52:20,540 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 12:52:20,540 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 12:52:20,540 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 12:52:20,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 12:52:20,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 12:52:20,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:52:20,611 INFO L158 Benchmark]: Toolchain (without parser) took 39382.63ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 123.1MB in the beginning and 957.4MB in the end (delta: -834.3MB). Peak memory consumption was 260.1MB. Max. memory is 16.1GB. [2025-02-06 12:52:20,612 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:52:20,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.80ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 95.5MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:52:20,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.89ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 91.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:52:20,614 INFO L158 Benchmark]: Boogie Preprocessor took 79.10ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 86.2MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:52:20,614 INFO L158 Benchmark]: IcfgBuilder took 975.21ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 81.5MB in the end (delta: 4.7MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2025-02-06 12:52:20,614 INFO L158 Benchmark]: TraceAbstraction took 37551.03ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 81.5MB in the beginning and 961.6MB in the end (delta: -880.0MB). Peak memory consumption was 219.2MB. Max. memory is 16.1GB. [2025-02-06 12:52:20,614 INFO L158 Benchmark]: Witness Printer took 82.99ms. Allocated memory is still 1.3GB. Free memory was 961.6MB in the beginning and 957.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:52:20,616 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.80ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 95.5MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.89ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 91.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.10ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 86.2MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 975.21ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 81.5MB in the end (delta: 4.7MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * TraceAbstraction took 37551.03ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 81.5MB in the beginning and 961.6MB in the end (delta: -880.0MB). Peak memory consumption was 219.2MB. Max. memory is 16.1GB. * Witness Printer took 82.99ms. Allocated memory is still 1.3GB. Free memory was 961.6MB in the beginning and 957.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 866]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 951 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 932 mSDsluCounter, 339 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 329 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4577 IncrementalHoareTripleChecker+Invalid, 4803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 10 mSDtfsCounter, 4577 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=11, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 3777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 12:52:20,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE