./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c -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 e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:01:16,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:01:16,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:01:16,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:01:16,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:01:16,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:01:16,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:01:16,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:01:16,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:01:16,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:01:16,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:01:16,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:01:16,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:01:16,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:01:16,870 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:01:16,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:01:16,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:01:16,873 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:01:16,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:01:16,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:01:16,873 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 -> e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 [2025-02-06 13:01:17,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:01:17,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:01:17,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:01:17,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:01:17,141 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:01:17,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-02-06 13:01:18,314 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/472399ac1/de7b3502b8724e7aae74f514eb450d12/FLAG4c1a11d49 [2025-02-06 13:01:18,522 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:01:18,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-02-06 13:01:18,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/472399ac1/de7b3502b8724e7aae74f514eb450d12/FLAG4c1a11d49 [2025-02-06 13:01:18,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/472399ac1/de7b3502b8724e7aae74f514eb450d12 [2025-02-06 13:01:18,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:01:18,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:01:18,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:01:18,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:01:18,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:01:18,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:01:18" (1/1) ... [2025-02-06 13:01:18,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c603cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:18, skipping insertion in model container [2025-02-06 13:01:18,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:01:18" (1/1) ... [2025-02-06 13:01:18,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:01:19,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:01:19,026 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:01:19,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:01:19,051 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:01:19,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19 WrapperNode [2025-02-06 13:01:19,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:01:19,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:01:19,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:01:19,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:01:19,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,092 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 19, calls inlined = 41, statements flattened = 351 [2025-02-06 13:01:19,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:01:19,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:01:19,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:01:19,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:01:19,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,118 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:01:19,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:01:19,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:01:19,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:01:19,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:01:19,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (1/1) ... [2025-02-06 13:01:19,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:01:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:01:19,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:01:19,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:01:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:01:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:01:19,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:01:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:01:19,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:01:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:01:19,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:01:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:01:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:01:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:01:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:01:19,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:01:19,184 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:01:19,264 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:01:19,265 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:01:19,698 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:01:19,698 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:01:20,068 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:01:20,068 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:01:20,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:20 BoogieIcfgContainer [2025-02-06 13:01:20,069 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:01:20,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:01:20,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:01:20,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:01:20,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:01:18" (1/3) ... [2025-02-06 13:01:20,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0d9b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:01:20, skipping insertion in model container [2025-02-06 13:01:20,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:01:19" (2/3) ... [2025-02-06 13:01:20,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0d9b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:01:20, skipping insertion in model container [2025-02-06 13:01:20,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:20" (3/3) ... [2025-02-06 13:01:20,079 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2025-02-06 13:01:20,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:01:20,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-subst.wvr.c that has 4 procedures, 28 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 13:01:20,095 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:01:20,164 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 13:01:20,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 75 flow [2025-02-06 13:01:20,228 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-06 13:01:20,230 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:01:20,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-06 13:01:20,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 27 transitions, 75 flow [2025-02-06 13:01:20,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 23 transitions, 64 flow [2025-02-06 13:01:20,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:01:20,256 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;@2b24cb68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:01:20,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 13:01:20,271 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:01:20,271 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-02-06 13:01:20,271 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:01:20,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:20,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:20,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:01:20,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -809096882, now seen corresponding path program 1 times [2025-02-06 13:01:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:20,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585769603] [2025-02-06 13:01:20,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:01:20,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:20,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:01:20,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:01:20,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:01:20,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:24,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:24,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585769603] [2025-02-06 13:01:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585769603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:24,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:24,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759576626] [2025-02-06 13:01:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:24,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:24,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:24,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 13:01:24,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:24,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:24,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 13:01:24,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:25,175 INFO L124 PetriNetUnfolderBase]: 178/334 cut-off events. [2025-02-06 13:01:25,176 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-06 13:01:25,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 334 events. 178/334 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1272 event pairs, 10 based on Foata normal form. 3/336 useless extension candidates. Maximal degree in co-relation 572. Up to 110 conditions per place. [2025-02-06 13:01:25,183 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 34 selfloop transitions, 5 changer transitions 8/51 dead transitions. [2025-02-06 13:01:25,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 244 flow [2025-02-06 13:01:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-02-06 13:01:25,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2025-02-06 13:01:25,200 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 64 flow. Second operand 6 states and 98 transitions. [2025-02-06 13:01:25,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 244 flow [2025-02-06 13:01:25,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:25,210 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 67 flow [2025-02-06 13:01:25,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=67, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-02-06 13:01:25,216 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2025-02-06 13:01:25,217 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 67 flow [2025-02-06 13:01:25,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:25,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:25,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:25,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:01:25,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:01:25,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:25,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1890671676, now seen corresponding path program 2 times [2025-02-06 13:01:25,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312345213] [2025-02-06 13:01:25,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:01:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:25,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:01:25,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:01:25,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:25,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:27,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312345213] [2025-02-06 13:01:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312345213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:27,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487537672] [2025-02-06 13:01:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:27,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:01:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:27,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:01:27,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:01:27,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 13:01:27,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 67 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:27,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:27,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 13:01:27,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:27,647 INFO L124 PetriNetUnfolderBase]: 194/366 cut-off events. [2025-02-06 13:01:27,647 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-02-06 13:01:27,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 366 events. 194/366 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1514 event pairs, 14 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 825. Up to 151 conditions per place. [2025-02-06 13:01:27,651 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 34 selfloop transitions, 6 changer transitions 12/56 dead transitions. [2025-02-06 13:01:27,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 56 transitions, 262 flow [2025-02-06 13:01:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:01:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:01:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2025-02-06 13:01:27,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5661375661375662 [2025-02-06 13:01:27,655 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 67 flow. Second operand 7 states and 107 transitions. [2025-02-06 13:01:27,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 56 transitions, 262 flow [2025-02-06 13:01:27,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 258 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 13:01:27,658 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 96 flow [2025-02-06 13:01:27,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2025-02-06 13:01:27,659 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2025-02-06 13:01:27,660 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 96 flow [2025-02-06 13:01:27,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:27,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:27,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:27,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:01:27,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:01:27,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1981474798, now seen corresponding path program 3 times [2025-02-06 13:01:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:27,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307062242] [2025-02-06 13:01:27,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:01:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:27,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:01:27,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:01:27,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 13:01:27,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307062242] [2025-02-06 13:01:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307062242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:29,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:29,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:29,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392534200] [2025-02-06 13:01:29,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:29,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:29,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:29,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:29,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 13:01:29,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:29,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:29,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 13:01:29,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:29,845 INFO L124 PetriNetUnfolderBase]: 189/369 cut-off events. [2025-02-06 13:01:29,845 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-02-06 13:01:29,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 369 events. 189/369 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1529 event pairs, 16 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 894. Up to 190 conditions per place. [2025-02-06 13:01:29,850 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 31 selfloop transitions, 5 changer transitions 12/52 dead transitions. [2025-02-06 13:01:29,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 267 flow [2025-02-06 13:01:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-02-06 13:01:29,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-02-06 13:01:29,855 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 96 flow. Second operand 6 states and 96 transitions. [2025-02-06 13:01:29,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 267 flow [2025-02-06 13:01:29,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 250 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-06 13:01:29,858 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 97 flow [2025-02-06 13:01:29,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2025-02-06 13:01:29,859 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2025-02-06 13:01:29,859 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 97 flow [2025-02-06 13:01:29,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:29,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:29,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:29,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:01:29,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:01:29,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash 757849672, now seen corresponding path program 4 times [2025-02-06 13:01:29,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:29,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763330938] [2025-02-06 13:01:29,861 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:01:29,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:29,881 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-02-06 13:01:29,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:01:29,928 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:01:29,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:31,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763330938] [2025-02-06 13:01:31,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763330938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:31,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:31,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:31,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737626419] [2025-02-06 13:01:31,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:31,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:31,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:31,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:31,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:31,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 13:01:31,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:31,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:31,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 13:01:31,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:31,709 INFO L124 PetriNetUnfolderBase]: 138/270 cut-off events. [2025-02-06 13:01:31,709 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-02-06 13:01:31,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 270 events. 138/270 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 995 event pairs, 20 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 676. Up to 109 conditions per place. [2025-02-06 13:01:31,713 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 30 selfloop transitions, 5 changer transitions 9/48 dead transitions. [2025-02-06 13:01:31,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 253 flow [2025-02-06 13:01:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-02-06 13:01:31,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2025-02-06 13:01:31,714 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 97 flow. Second operand 6 states and 92 transitions. [2025-02-06 13:01:31,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 253 flow [2025-02-06 13:01:31,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 231 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-06 13:01:31,718 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 88 flow [2025-02-06 13:01:31,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2025-02-06 13:01:31,718 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2025-02-06 13:01:31,718 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 88 flow [2025-02-06 13:01:31,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:31,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:31,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:31,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:01:31,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:01:31,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:31,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2077730506, now seen corresponding path program 5 times [2025-02-06 13:01:31,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:31,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848155096] [2025-02-06 13:01:31,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:01:31,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:31,734 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:01:31,764 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:01:31,764 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:01:31,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:33,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:33,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848155096] [2025-02-06 13:01:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848155096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:33,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:33,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602436734] [2025-02-06 13:01:33,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:33,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:33,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:33,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 13:01:33,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:33,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:33,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 13:01:33,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:34,400 INFO L124 PetriNetUnfolderBase]: 101/200 cut-off events. [2025-02-06 13:01:34,401 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2025-02-06 13:01:34,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 200 events. 101/200 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 667 event pairs, 5 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 532. Up to 69 conditions per place. [2025-02-06 13:01:34,402 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 19 selfloop transitions, 3 changer transitions 19/45 dead transitions. [2025-02-06 13:01:34,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 228 flow [2025-02-06 13:01:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-02-06 13:01:34,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-06 13:01:34,403 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 88 flow. Second operand 6 states and 90 transitions. [2025-02-06 13:01:34,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 228 flow [2025-02-06 13:01:34,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 215 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-06 13:01:34,404 INFO L231 Difference]: Finished difference. Result has 44 places, 21 transitions, 75 flow [2025-02-06 13:01:34,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=75, PETRI_PLACES=44, PETRI_TRANSITIONS=21} [2025-02-06 13:01:34,404 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-02-06 13:01:34,404 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 21 transitions, 75 flow [2025-02-06 13:01:34,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:34,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:01:34,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:01:34,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:01:34,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:01:34,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:01:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2142396480, now seen corresponding path program 6 times [2025-02-06 13:01:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:01:34,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-02-06 13:01:34,407 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 13:01:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:01:34,418 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:01:34,456 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:01:34,456 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 13:01:34,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:01:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:01:35,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:01:35,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-02-06 13:01:35,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892007589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:01:35,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:01:35,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:01:35,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336062407] [2025-02-06 13:01:35,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:01:35,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:01:35,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:01:35,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:01:35,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:01:35,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 13:01:35,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 21 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:35,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:01:35,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 13:01:35,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:01:36,259 INFO L124 PetriNetUnfolderBase]: 42/89 cut-off events. [2025-02-06 13:01:36,259 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-02-06 13:01:36,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 89 events. 42/89 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 187 event pairs, 0 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 240. Up to 54 conditions per place. [2025-02-06 13:01:36,260 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2025-02-06 13:01:36,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 26 transitions, 130 flow [2025-02-06 13:01:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:01:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:01:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2025-02-06 13:01:36,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-02-06 13:01:36,262 INFO L175 Difference]: Start difference. First operand has 44 places, 21 transitions, 75 flow. Second operand 6 states and 72 transitions. [2025-02-06 13:01:36,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 26 transitions, 130 flow [2025-02-06 13:01:36,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 114 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-02-06 13:01:36,264 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2025-02-06 13:01:36,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2025-02-06 13:01:36,265 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2025-02-06 13:01:36,265 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 0 transitions, 0 flow [2025-02-06 13:01:36,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:01:36,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-02-06 13:01:36,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-06 13:01:36,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-06 13:01:36,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-06 13:01:36,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-02-06 13:01:36,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:01:36,272 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-02-06 13:01:36,274 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:01:36,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:01:36,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:01:36 BasicIcfg [2025-02-06 13:01:36,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:01:36,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:01:36,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:01:36,281 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:01:36,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:01:20" (3/4) ... [2025-02-06 13:01:36,283 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:01:36,285 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 13:01:36,285 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 13:01:36,285 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 13:01:36,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2025-02-06 13:01:36,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-02-06 13:01:36,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-06 13:01:36,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:01:36,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:01:36,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:01:36,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:01:36,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:01:36,353 INFO L158 Benchmark]: Toolchain (without parser) took 17476.21ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 106.2MB in the beginning and 728.0MB in the end (delta: -621.9MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2025-02-06 13:01:36,353 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:01:36,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.40ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:01:36,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.61ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.0MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:01:36,354 INFO L158 Benchmark]: Boogie Preprocessor took 33.63ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:01:36,354 INFO L158 Benchmark]: IcfgBuilder took 939.32ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 91.4MB in the end (delta: -3.3MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-02-06 13:01:36,355 INFO L158 Benchmark]: TraceAbstraction took 16210.14ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 90.7MB in the beginning and 736.4MB in the end (delta: -645.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:01:36,355 INFO L158 Benchmark]: Witness Printer took 71.57ms. Allocated memory is still 788.5MB. Free memory was 736.4MB in the beginning and 728.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:01:36,356 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.16ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.40ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.61ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.0MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.63ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 939.32ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 91.4MB in the end (delta: -3.3MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16210.14ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 90.7MB in the beginning and 736.4MB in the end (delta: -645.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.57ms. Allocated memory is still 788.5MB. Free memory was 736.4MB in the beginning and 728.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 75]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 43 locations, 5 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: 16.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517 IncrementalHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=3, InterpolantAutomatonStates: 37, 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.6s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 6218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 13:01:36,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE