./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi000_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/rfi000_tso.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 5128c539cd3051e20c09e1924eb0951d5be697be251e10d3c281464ed4c436cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:21:27,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:21:27,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:21:27,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:21:27,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:21:27,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:21:27,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:21:27,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:21:27,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:21:27,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:21:27,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:21:27,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:21:27,739 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:21:27,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:27,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:21:27,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:21:27,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:21:27,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:21:27,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:21:27,741 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 -> 5128c539cd3051e20c09e1924eb0951d5be697be251e10d3c281464ed4c436cd [2025-02-08 08:21:27,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:21:28,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:21:28,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:21:28,005 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:21:28,005 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:21:28,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi000_tso.i [2025-02-08 08:21:29,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8c192d13/40576bcb2a2e4fda9b268bd2e7e77aa9/FLAGd7476fe87 [2025-02-08 08:21:29,631 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:21:29,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi000_tso.i [2025-02-08 08:21:29,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8c192d13/40576bcb2a2e4fda9b268bd2e7e77aa9/FLAGd7476fe87 [2025-02-08 08:21:29,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8c192d13/40576bcb2a2e4fda9b268bd2e7e77aa9 [2025-02-08 08:21:29,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:21:29,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:21:29,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:29,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:21:29,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:21:29,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:29" (1/1) ... [2025-02-08 08:21:29,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d56070d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:29, skipping insertion in model container [2025-02-08 08:21:29,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:29" (1/1) ... [2025-02-08 08:21:29,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:21:30,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:30,089 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:21:30,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:30,150 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:21:30,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30 WrapperNode [2025-02-08 08:21:30,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:30,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:30,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:21:30,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:21:30,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,186 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2025-02-08 08:21:30,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:30,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:21:30,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:21:30,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:21:30,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,217 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-08 08:21:30,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:21:30,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:21:30,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:21:30,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:21:30,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (1/1) ... [2025-02-08 08:21:30,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:30,268 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-08 08:21:30,272 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-08 08:21:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:21:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:21:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:21:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:21:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:21:30,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:21:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:21:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:21:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:21:30,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:21:30,289 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:21:30,390 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:21:30,392 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:21:30,690 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:21:30,691 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:21:30,910 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:21:30,910 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:21:30,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:30 BoogieIcfgContainer [2025-02-08 08:21:30,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:21:30,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:21:30,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:21:30,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:21:30,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:21:29" (1/3) ... [2025-02-08 08:21:30,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634a70a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:30, skipping insertion in model container [2025-02-08 08:21:30,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:30" (2/3) ... [2025-02-08 08:21:30,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634a70a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:30, skipping insertion in model container [2025-02-08 08:21:30,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:30" (3/3) ... [2025-02-08 08:21:30,917 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi000_tso.i [2025-02-08 08:21:30,928 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:21:30,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi000_tso.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:21:30,930 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:21:30,968 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:21:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2025-02-08 08:21:31,010 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2025-02-08 08:21:31,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:31,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-08 08:21:31,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2025-02-08 08:21:31,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2025-02-08 08:21:31,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:21:31,029 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;@45799aff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:21:31,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:21:31,036 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:21:31,036 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 08:21:31,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:31,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:31,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:31,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:31,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash -58095373, now seen corresponding path program 1 times [2025-02-08 08:21:31,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453451522] [2025-02-08 08:21:31,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:31,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:21:31,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:21:31,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:31,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:31,464 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-08 08:21:31,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453451522] [2025-02-08 08:21:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453451522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:31,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:31,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120269846] [2025-02-08 08:21:31,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:31,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:31,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:31,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:31,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:31,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-08 08:21:31,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:31,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:31,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:31,832 INFO L124 PetriNetUnfolderBase]: 783/1327 cut-off events. [2025-02-08 08:21:31,832 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:21:31,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 1327 events. 783/1327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6571 event pairs, 159 based on Foata normal form. 96/1420 useless extension candidates. Maximal degree in co-relation 2611. Up to 985 conditions per place. [2025-02-08 08:21:31,840 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2025-02-08 08:21:31,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 174 flow [2025-02-08 08:21:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-08 08:21:31,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-02-08 08:21:31,856 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 68 transitions. [2025-02-08 08:21:31,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 174 flow [2025-02-08 08:21:31,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:31,864 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2025-02-08 08:21:31,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-08 08:21:31,867 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-02-08 08:21:31,868 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2025-02-08 08:21:31,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-08 08:21:31,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:31,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:31,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:21:31,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:31,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash 38109954, now seen corresponding path program 1 times [2025-02-08 08:21:31,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:31,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911502590] [2025-02-08 08:21:31,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:31,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:31,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:31,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:31,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:31,961 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-08 08:21:31,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:31,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911502590] [2025-02-08 08:21:31,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911502590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:31,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:31,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427562474] [2025-02-08 08:21:31,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:31,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:31,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:31,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:31,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:31,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 08:21:31,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:31,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:31,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:32,196 INFO L124 PetriNetUnfolderBase]: 701/1251 cut-off events. [2025-02-08 08:21:32,197 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-08 08:21:32,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1251 events. 701/1251 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6296 event pairs, 701 based on Foata normal form. 48/1290 useless extension candidates. Maximal degree in co-relation 2459. Up to 1146 conditions per place. [2025-02-08 08:21:32,204 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 22 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2025-02-08 08:21:32,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 114 flow [2025-02-08 08:21:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-08 08:21:32,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4144144144144144 [2025-02-08 08:21:32,206 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 46 transitions. [2025-02-08 08:21:32,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 114 flow [2025-02-08 08:21:32,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:32,207 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2025-02-08 08:21:32,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-02-08 08:21:32,208 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-02-08 08:21:32,209 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2025-02-08 08:21:32,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 08:21:32,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:32,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:32,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:21:32,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:32,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash 38111254, now seen corresponding path program 1 times [2025-02-08 08:21:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:32,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110782273] [2025-02-08 08:21:32,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:32,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:32,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:32,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:32,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:32,550 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-08 08:21:32,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110782273] [2025-02-08 08:21:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110782273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:32,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:32,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753542116] [2025-02-08 08:21:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:32,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:32,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:32,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:32,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:32,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-08 08:21:32,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:32,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:32,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:32,906 INFO L124 PetriNetUnfolderBase]: 885/1561 cut-off events. [2025-02-08 08:21:32,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:32,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1561 events. 885/1561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7982 event pairs, 375 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 3039. Up to 978 conditions per place. [2025-02-08 08:21:32,911 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 29 selfloop transitions, 3 changer transitions 48/84 dead transitions. [2025-02-08 08:21:32,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 84 transitions, 336 flow [2025-02-08 08:21:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:21:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:21:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2025-02-08 08:21:32,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46621621621621623 [2025-02-08 08:21:32,914 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 138 transitions. [2025-02-08 08:21:32,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 84 transitions, 336 flow [2025-02-08 08:21:32,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 84 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:21:32,917 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 94 flow [2025-02-08 08:21:32,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2025-02-08 08:21:32,917 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-02-08 08:21:32,918 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 94 flow [2025-02-08 08:21:32,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-08 08:21:32,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:32,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:32,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:21:32,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:32,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -546794475, now seen corresponding path program 1 times [2025-02-08 08:21:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:32,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830917481] [2025-02-08 08:21:32,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:32,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:21:32,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:21:32,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:32,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:33,515 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-08 08:21:33,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:33,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830917481] [2025-02-08 08:21:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830917481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:33,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:33,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:21:33,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840589101] [2025-02-08 08:21:33,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:33,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:21:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:33,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:21:33,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:21:33,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:33,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-08 08:21:33,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:33,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:33,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:34,097 INFO L124 PetriNetUnfolderBase]: 726/1274 cut-off events. [2025-02-08 08:21:34,097 INFO L125 PetriNetUnfolderBase]: For 812/815 co-relation queries the response was YES. [2025-02-08 08:21:34,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1274 events. 726/1274 cut-off events. For 812/815 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6095 event pairs, 190 based on Foata normal form. 51/1323 useless extension candidates. Maximal degree in co-relation 3100. Up to 654 conditions per place. [2025-02-08 08:21:34,101 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 38 selfloop transitions, 7 changer transitions 49/98 dead transitions. [2025-02-08 08:21:34,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 98 transitions, 486 flow [2025-02-08 08:21:34,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:21:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:21:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2025-02-08 08:21:34,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2025-02-08 08:21:34,103 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 94 flow. Second operand 10 states and 165 transitions. [2025-02-08 08:21:34,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 98 transitions, 486 flow [2025-02-08 08:21:34,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 98 transitions, 463 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-02-08 08:21:34,107 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 171 flow [2025-02-08 08:21:34,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=171, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2025-02-08 08:21:34,108 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-02-08 08:21:34,108 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 171 flow [2025-02-08 08:21:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-08 08:21:34,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:34,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:34,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:21:34,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:34,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1747182314, now seen corresponding path program 1 times [2025-02-08 08:21:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:34,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076276592] [2025-02-08 08:21:34,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:34,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:34,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:21:34,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:21:34,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:34,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:34,333 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-08 08:21:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076276592] [2025-02-08 08:21:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076276592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:34,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:34,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178013808] [2025-02-08 08:21:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:34,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:34,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:34,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:34,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:34,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:34,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:34,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:34,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:34,599 INFO L124 PetriNetUnfolderBase]: 631/1122 cut-off events. [2025-02-08 08:21:34,600 INFO L125 PetriNetUnfolderBase]: For 2347/2350 co-relation queries the response was YES. [2025-02-08 08:21:34,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1122 events. 631/1122 cut-off events. For 2347/2350 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5154 event pairs, 247 based on Foata normal form. 35/1155 useless extension candidates. Maximal degree in co-relation 3747. Up to 588 conditions per place. [2025-02-08 08:21:34,605 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 38 selfloop transitions, 3 changer transitions 39/84 dead transitions. [2025-02-08 08:21:34,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 599 flow [2025-02-08 08:21:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:21:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:21:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2025-02-08 08:21:34,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44015444015444016 [2025-02-08 08:21:34,608 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 171 flow. Second operand 7 states and 114 transitions. [2025-02-08 08:21:34,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 599 flow [2025-02-08 08:21:34,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 575 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-02-08 08:21:34,617 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 174 flow [2025-02-08 08:21:34,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2025-02-08 08:21:34,619 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-02-08 08:21:34,620 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 174 flow [2025-02-08 08:21:34,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:34,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:34,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:34,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:21:34,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:34,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1494925364, now seen corresponding path program 1 times [2025-02-08 08:21:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:34,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044499053] [2025-02-08 08:21:34,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:34,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:34,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:21:34,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:21:34,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:34,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:35,721 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-08 08:21:35,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:35,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044499053] [2025-02-08 08:21:35,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044499053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:35,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:35,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:21:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252961973] [2025-02-08 08:21:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:35,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:21:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:35,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:21:35,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:21:35,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:35,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 174 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-08 08:21:35,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:35,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:35,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:36,076 INFO L124 PetriNetUnfolderBase]: 612/1092 cut-off events. [2025-02-08 08:21:36,076 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2025-02-08 08:21:36,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 1092 events. 612/1092 cut-off events. For 2163/2163 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5003 event pairs, 260 based on Foata normal form. 27/1118 useless extension candidates. Maximal degree in co-relation 3646. Up to 851 conditions per place. [2025-02-08 08:21:36,084 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 47 selfloop transitions, 7 changer transitions 29/87 dead transitions. [2025-02-08 08:21:36,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 87 transitions, 570 flow [2025-02-08 08:21:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:21:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:21:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-02-08 08:21:36,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4114114114114114 [2025-02-08 08:21:36,085 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 174 flow. Second operand 9 states and 137 transitions. [2025-02-08 08:21:36,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 87 transitions, 570 flow [2025-02-08 08:21:36,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 539 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-02-08 08:21:36,091 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 213 flow [2025-02-08 08:21:36,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=213, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-02-08 08:21:36,093 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2025-02-08 08:21:36,094 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 213 flow [2025-02-08 08:21:36,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-08 08:21:36,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:36,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:36,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:21:36,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:36,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1189100974, now seen corresponding path program 2 times [2025-02-08 08:21:36,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:36,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678621070] [2025-02-08 08:21:36,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:21:36,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:36,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:21:36,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:21:36,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:36,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:36,779 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-08 08:21:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678621070] [2025-02-08 08:21:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678621070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:36,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:21:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277133864] [2025-02-08 08:21:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:36,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:21:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:36,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:21:36,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:21:36,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:36,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 213 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-08 08:21:36,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:36,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:36,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:37,217 INFO L124 PetriNetUnfolderBase]: 591/1051 cut-off events. [2025-02-08 08:21:37,217 INFO L125 PetriNetUnfolderBase]: For 2223/2223 co-relation queries the response was YES. [2025-02-08 08:21:37,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1051 events. 591/1051 cut-off events. For 2223/2223 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4644 event pairs, 256 based on Foata normal form. 27/1077 useless extension candidates. Maximal degree in co-relation 3664. Up to 809 conditions per place. [2025-02-08 08:21:37,222 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 47 selfloop transitions, 13 changer transitions 29/93 dead transitions. [2025-02-08 08:21:37,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 641 flow [2025-02-08 08:21:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:21:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:21:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-02-08 08:21:37,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4114114114114114 [2025-02-08 08:21:37,223 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 213 flow. Second operand 9 states and 137 transitions. [2025-02-08 08:21:37,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 641 flow [2025-02-08 08:21:37,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 623 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-02-08 08:21:37,227 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 302 flow [2025-02-08 08:21:37,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=302, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2025-02-08 08:21:37,227 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2025-02-08 08:21:37,228 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 302 flow [2025-02-08 08:21:37,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-08 08:21:37,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:37,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:37,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:21:37,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:37,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1940467467, now seen corresponding path program 1 times [2025-02-08 08:21:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270816523] [2025-02-08 08:21:37,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:37,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:37,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:21:37,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:21:37,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:37,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:37,427 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-08 08:21:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270816523] [2025-02-08 08:21:37,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270816523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:37,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:37,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:21:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030333492] [2025-02-08 08:21:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:37,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:21:37,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:37,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:21:37,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:21:37,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:37,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-08 08:21:37,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:37,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:37,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:37,681 INFO L124 PetriNetUnfolderBase]: 380/713 cut-off events. [2025-02-08 08:21:37,682 INFO L125 PetriNetUnfolderBase]: For 1384/1387 co-relation queries the response was YES. [2025-02-08 08:21:37,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2523 conditions, 713 events. 380/713 cut-off events. For 1384/1387 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3050 event pairs, 86 based on Foata normal form. 53/764 useless extension candidates. Maximal degree in co-relation 2494. Up to 302 conditions per place. [2025-02-08 08:21:37,687 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 57 selfloop transitions, 4 changer transitions 1/66 dead transitions. [2025-02-08 08:21:37,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 514 flow [2025-02-08 08:21:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:21:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:21:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-08 08:21:37,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-02-08 08:21:37,689 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 302 flow. Second operand 4 states and 83 transitions. [2025-02-08 08:21:37,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 514 flow [2025-02-08 08:21:37,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 460 flow, removed 11 selfloop flow, removed 12 redundant places. [2025-02-08 08:21:37,695 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2025-02-08 08:21:37,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-02-08 08:21:37,696 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-02-08 08:21:37,697 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2025-02-08 08:21:37,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-08 08:21:37,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:37,697 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] [2025-02-08 08:21:37,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:21:37,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:37,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash 390768604, now seen corresponding path program 1 times [2025-02-08 08:21:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:37,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051852647] [2025-02-08 08:21:37,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:37,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:21:37,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:21:37,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:37,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:38,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-08 08:21:38,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:38,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051852647] [2025-02-08 08:21:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051852647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:38,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:38,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:21:38,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393481978] [2025-02-08 08:21:38,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:38,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:21:38,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:38,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:21:38,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:21:38,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:38,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 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-08 08:21:38,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:38,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:38,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:39,660 INFO L124 PetriNetUnfolderBase]: 733/1369 cut-off events. [2025-02-08 08:21:39,660 INFO L125 PetriNetUnfolderBase]: For 2256/2256 co-relation queries the response was YES. [2025-02-08 08:21:39,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4824 conditions, 1369 events. 733/1369 cut-off events. For 2256/2256 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6937 event pairs, 250 based on Foata normal form. 22/1389 useless extension candidates. Maximal degree in co-relation 4801. Up to 432 conditions per place. [2025-02-08 08:21:39,667 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 77 selfloop transitions, 22 changer transitions 46/149 dead transitions. [2025-02-08 08:21:39,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 149 transitions, 1106 flow [2025-02-08 08:21:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:21:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 08:21:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2025-02-08 08:21:39,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4247104247104247 [2025-02-08 08:21:39,668 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 14 states and 220 transitions. [2025-02-08 08:21:39,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 149 transitions, 1106 flow [2025-02-08 08:21:39,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 149 transitions, 1066 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:39,674 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 425 flow [2025-02-08 08:21:39,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=425, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2025-02-08 08:21:39,675 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2025-02-08 08:21:39,675 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 425 flow [2025-02-08 08:21:39,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 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-08 08:21:39,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:39,676 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] [2025-02-08 08:21:39,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:21:39,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -74614244, now seen corresponding path program 2 times [2025-02-08 08:21:39,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:39,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114293213] [2025-02-08 08:21:39,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:21:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:39,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:21:39,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:21:39,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:39,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:39,835 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-08 08:21:39,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114293213] [2025-02-08 08:21:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114293213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:39,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:39,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:39,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238952969] [2025-02-08 08:21:39,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:39,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:39,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:39,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:39,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:39,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 425 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-08 08:21:39,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:39,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:39,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:39,960 INFO L124 PetriNetUnfolderBase]: 355/703 cut-off events. [2025-02-08 08:21:39,960 INFO L125 PetriNetUnfolderBase]: For 1744/1747 co-relation queries the response was YES. [2025-02-08 08:21:39,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2593 conditions, 703 events. 355/703 cut-off events. For 1744/1747 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3128 event pairs, 81 based on Foata normal form. 56/757 useless extension candidates. Maximal degree in co-relation 2561. Up to 296 conditions per place. [2025-02-08 08:21:39,964 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 47 selfloop transitions, 6 changer transitions 15/72 dead transitions. [2025-02-08 08:21:39,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 650 flow [2025-02-08 08:21:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:21:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:21:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-02-08 08:21:39,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2025-02-08 08:21:39,966 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 425 flow. Second operand 5 states and 84 transitions. [2025-02-08 08:21:39,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 650 flow [2025-02-08 08:21:39,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 572 flow, removed 34 selfloop flow, removed 9 redundant places. [2025-02-08 08:21:39,970 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 273 flow [2025-02-08 08:21:39,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2025-02-08 08:21:39,970 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2025-02-08 08:21:39,970 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 273 flow [2025-02-08 08:21:39,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-08 08:21:39,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:39,970 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] [2025-02-08 08:21:39,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:21:39,971 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:39,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:39,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1720286698, now seen corresponding path program 1 times [2025-02-08 08:21:39,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:39,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466113209] [2025-02-08 08:21:39,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:39,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:39,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:21:40,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:21:40,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:40,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:41,400 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-08 08:21:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466113209] [2025-02-08 08:21:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466113209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:41,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:41,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:21:41,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621125649] [2025-02-08 08:21:41,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:41,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:21:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:41,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:21:41,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:21:41,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:41,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 44 transitions, 273 flow. Second operand has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 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-08 08:21:41,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:41,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:41,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:41,970 INFO L124 PetriNetUnfolderBase]: 199/400 cut-off events. [2025-02-08 08:21:41,970 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2025-02-08 08:21:41,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 400 events. 199/400 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1408 event pairs, 71 based on Foata normal form. 4/403 useless extension candidates. Maximal degree in co-relation 1412. Up to 212 conditions per place. [2025-02-08 08:21:41,972 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 32 selfloop transitions, 8 changer transitions 33/77 dead transitions. [2025-02-08 08:21:41,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 77 transitions, 579 flow [2025-02-08 08:21:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:21:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:21:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2025-02-08 08:21:41,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3663663663663664 [2025-02-08 08:21:41,973 INFO L175 Difference]: Start difference. First operand has 67 places, 44 transitions, 273 flow. Second operand 9 states and 122 transitions. [2025-02-08 08:21:41,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 77 transitions, 579 flow [2025-02-08 08:21:41,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 77 transitions, 465 flow, removed 31 selfloop flow, removed 13 redundant places. [2025-02-08 08:21:41,976 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 210 flow [2025-02-08 08:21:41,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2025-02-08 08:21:41,976 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2025-02-08 08:21:41,976 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 210 flow [2025-02-08 08:21:41,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 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-08 08:21:41,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:41,977 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] [2025-02-08 08:21:41,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:21:41,977 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:41,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1582792768, now seen corresponding path program 2 times [2025-02-08 08:21:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:41,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462727916] [2025-02-08 08:21:41,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:21:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:41,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:21:41,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:21:41,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:41,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:42,119 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-08 08:21:42,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:42,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462727916] [2025-02-08 08:21:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462727916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:42,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:21:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257249207] [2025-02-08 08:21:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:42,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:42,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:42,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:42,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:42,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-08 08:21:42,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:42,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:42,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:42,219 INFO L124 PetriNetUnfolderBase]: 120/231 cut-off events. [2025-02-08 08:21:42,219 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-02-08 08:21:42,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 231 events. 120/231 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 658 event pairs, 51 based on Foata normal form. 4/234 useless extension candidates. Maximal degree in co-relation 756. Up to 159 conditions per place. [2025-02-08 08:21:42,220 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 0 selfloop transitions, 0 changer transitions 46/46 dead transitions. [2025-02-08 08:21:42,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 46 transitions, 330 flow [2025-02-08 08:21:42,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:21:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:21:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-02-08 08:21:42,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2025-02-08 08:21:42,221 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 210 flow. Second operand 5 states and 68 transitions. [2025-02-08 08:21:42,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 46 transitions, 330 flow [2025-02-08 08:21:42,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 287 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-02-08 08:21:42,222 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2025-02-08 08:21:42,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2025-02-08 08:21:42,223 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-02-08 08:21:42,223 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2025-02-08 08:21:42,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-08 08:21:42,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-08 08:21:42,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:21:42,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:21:42,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 08:21:42,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-08 08:21:42,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:21:42,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:21:42,226 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:42,229 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:21:42,229 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:21:42,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:21:42 BasicIcfg [2025-02-08 08:21:42,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:21:42,233 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:21:42,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:21:42,233 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:21:42,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:30" (3/4) ... [2025-02-08 08:21:42,234 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:21:42,236 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-02-08 08:21:42,236 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-02-08 08:21:42,238 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-02-08 08:21:42,239 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 08:21:42,239 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 08:21:42,239 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:21:42,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:21:42,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:21:42,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:21:42,326 INFO L158 Benchmark]: Toolchain (without parser) took 12515.21ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 109.6MB in the beginning and 407.6MB in the end (delta: -298.1MB). Peak memory consumption was 159.4MB. Max. memory is 16.1GB. [2025-02-08 08:21:42,326 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:42,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.63ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 84.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:21:42,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.71ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 81.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:42,326 INFO L158 Benchmark]: Boogie Preprocessor took 49.03ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 77.5MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:21:42,326 INFO L158 Benchmark]: IcfgBuilder took 674.84ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 77.8MB in the end (delta: -271.0kB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-02-08 08:21:42,326 INFO L158 Benchmark]: TraceAbstraction took 11320.44ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 77.0MB in the beginning and 416.0MB in the end (delta: -339.0MB). Peak memory consumption was 127.8MB. Max. memory is 16.1GB. [2025-02-08 08:21:42,327 INFO L158 Benchmark]: Witness Printer took 92.30ms. Allocated memory is still 604.0MB. Free memory was 416.0MB in the beginning and 407.6MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:42,327 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.63ms. Allocated memory is still 142.6MB. Free memory was 109.1MB in the beginning and 84.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.71ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 81.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.03ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 77.5MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 674.84ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 77.8MB in the end (delta: -271.0kB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11320.44ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 77.0MB in the beginning and 416.0MB in the end (delta: -339.0MB). Peak memory consumption was 127.8MB. Max. memory is 16.1GB. * Witness Printer took 92.30ms. Allocated memory is still 604.0MB. Free memory was 416.0MB in the beginning and 407.6MB in the end (delta: 8.4MB). 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: 824]: 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 5 procedures, 55 locations, 6 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: 11.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2248 IncrementalHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 0 mSDtfsCounter, 2248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=9, InterpolantAutomatonStates: 86, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-08 08:21:42,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE