./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --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/weaver/popl20-threaded-sum-3.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 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:43:25,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:43:25,959 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:43:25,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:43:25,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:43:25,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:43:25,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:43:25,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:43:25,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:43:25,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:43:25,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:43:25,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:43:25,979 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:43:25,979 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:43:25,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:43:25,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:43:25,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:43:25,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:43:25,984 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2025-02-08 08:43:26,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:43:26,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:43:26,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:43:26,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:43:26,212 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:43:26,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-02-08 08:43:27,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/235d4f342/662657d5f4d34e749f1af560190d8193/FLAG3705e93fd [2025-02-08 08:43:27,700 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:43:27,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-02-08 08:43:27,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/235d4f342/662657d5f4d34e749f1af560190d8193/FLAG3705e93fd [2025-02-08 08:43:27,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/235d4f342/662657d5f4d34e749f1af560190d8193 [2025-02-08 08:43:27,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:43:27,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:43:27,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:43:27,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:43:27,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:43:27,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:43:27" (1/1) ... [2025-02-08 08:43:27,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472427b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:27, skipping insertion in model container [2025-02-08 08:43:27,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:43:27" (1/1) ... [2025-02-08 08:43:28,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:43:28,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:43:28,171 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:43:28,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:43:28,209 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:43:28,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28 WrapperNode [2025-02-08 08:43:28,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:43:28,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:43:28,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:43:28,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:43:28,215 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:43:28" (1/1) ... [2025-02-08 08:43:28,219 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:43:28" (1/1) ... [2025-02-08 08:43:28,231 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-02-08 08:43:28,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:43:28,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:43:28,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:43:28,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:43:28,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,256 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:43:28,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:43:28,271 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:43:28,271 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:43:28,271 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:43:28,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (1/1) ... [2025-02-08 08:43:28,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:43:28,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:43:28,310 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:43:28,321 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:43:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:43:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:43:28,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:43:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:43:28,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:43:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:43:28,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:43:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:43:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:43:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:43:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:43:28,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:43:28,340 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:43:28,439 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:43:28,440 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:43:28,662 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:43:28,662 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:43:28,801 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:43:28,802 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:43:28,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:43:28 BoogieIcfgContainer [2025-02-08 08:43:28,802 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:43:28,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:43:28,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:43:28,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:43:28,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:43:27" (1/3) ... [2025-02-08 08:43:28,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ee252e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:43:28, skipping insertion in model container [2025-02-08 08:43:28,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:43:28" (2/3) ... [2025-02-08 08:43:28,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ee252e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:43:28, skipping insertion in model container [2025-02-08 08:43:28,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:43:28" (3/3) ... [2025-02-08 08:43:28,815 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-02-08 08:43:28,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:43:28,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 35 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-02-08 08:43:28,837 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:43:28,903 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:43:28,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 95 flow [2025-02-08 08:43:28,955 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2025-02-08 08:43:28,956 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:43:28,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-02-08 08:43:28,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 37 transitions, 95 flow [2025-02-08 08:43:28,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2025-02-08 08:43:28,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:43:28,973 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;@7e7840a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:43:28,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 08:43:28,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:43:28,982 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-02-08 08:43:28,982 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:43:28,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:28,982 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-08 08:43:28,983 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-08 08:43:28,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1725908623, now seen corresponding path program 1 times [2025-02-08 08:43:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:28,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940735438] [2025-02-08 08:43:28,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:29,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:43:29,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:43:29,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:29,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:29,598 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:43:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940735438] [2025-02-08 08:43:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940735438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:29,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:43:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464159722] [2025-02-08 08:43:29,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:29,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:43:29,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:29,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:43:29,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:43:29,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-08 08:43:29,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:43:29,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:29,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-08 08:43:29,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:29,892 INFO L124 PetriNetUnfolderBase]: 644/1018 cut-off events. [2025-02-08 08:43:29,892 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-08 08:43:29,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1018 events. 644/1018 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4556 event pairs, 47 based on Foata normal form. 36/1045 useless extension candidates. Maximal degree in co-relation 1805. Up to 727 conditions per place. [2025-02-08 08:43:29,905 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 43 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-02-08 08:43:29,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 236 flow [2025-02-08 08:43:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:43:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:43:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-02-08 08:43:29,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2025-02-08 08:43:29,917 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 4 states and 94 transitions. [2025-02-08 08:43:29,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 236 flow [2025-02-08 08:43:29,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:43:29,926 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2025-02-08 08:43:29,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-02-08 08:43:29,930 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2025-02-08 08:43:29,932 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2025-02-08 08:43:29,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:43:29,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:29,932 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] [2025-02-08 08:43:29,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:43:29,932 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-08 08:43:29,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:29,933 INFO L85 PathProgramCache]: Analyzing trace with hash -740160640, now seen corresponding path program 1 times [2025-02-08 08:43:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051905320] [2025-02-08 08:43:29,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:29,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:43:29,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:43:29,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:29,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051905320] [2025-02-08 08:43:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051905320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:43:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648699315] [2025-02-08 08:43:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:30,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:43:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:30,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:43:30,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:43:30,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-02-08 08:43:30,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:30,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:30,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-02-08 08:43:30,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:30,693 INFO L124 PetriNetUnfolderBase]: 1225/1894 cut-off events. [2025-02-08 08:43:30,693 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-02-08 08:43:30,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4249 conditions, 1894 events. 1225/1894 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9325 event pairs, 384 based on Foata normal form. 28/1913 useless extension candidates. Maximal degree in co-relation 2782. Up to 1047 conditions per place. [2025-02-08 08:43:30,705 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 67 selfloop transitions, 20 changer transitions 0/93 dead transitions. [2025-02-08 08:43:30,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 93 transitions, 450 flow [2025-02-08 08:43:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:43:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:43:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-02-08 08:43:30,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2025-02-08 08:43:30,709 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 5 states and 125 transitions. [2025-02-08 08:43:30,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 93 transitions, 450 flow [2025-02-08 08:43:30,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 450 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:43:30,713 INFO L231 Difference]: Finished difference. Result has 44 places, 53 transitions, 256 flow [2025-02-08 08:43:30,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=44, PETRI_TRANSITIONS=53} [2025-02-08 08:43:30,714 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-02-08 08:43:30,714 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 256 flow [2025-02-08 08:43:30,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:30,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:30,715 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] [2025-02-08 08:43:30,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:43:30,715 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-08 08:43:30,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 543663164, now seen corresponding path program 2 times [2025-02-08 08:43:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:30,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175469243] [2025-02-08 08:43:30,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:43:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:30,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:43:30,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:43:30,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:43:30,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:30,947 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:43:30,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:30,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175469243] [2025-02-08 08:43:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175469243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:30,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:43:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772595259] [2025-02-08 08:43:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:30,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:43:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:30,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:43:30,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:43:30,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-08 08:43:30,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:43:30,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:30,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-08 08:43:30,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:31,171 INFO L124 PetriNetUnfolderBase]: 1173/1831 cut-off events. [2025-02-08 08:43:31,172 INFO L125 PetriNetUnfolderBase]: For 1738/1738 co-relation queries the response was YES. [2025-02-08 08:43:31,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5371 conditions, 1831 events. 1173/1831 cut-off events. For 1738/1738 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8870 event pairs, 190 based on Foata normal form. 114/1939 useless extension candidates. Maximal degree in co-relation 3938. Up to 891 conditions per place. [2025-02-08 08:43:31,184 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 77 selfloop transitions, 6 changer transitions 2/92 dead transitions. [2025-02-08 08:43:31,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 92 transitions, 584 flow [2025-02-08 08:43:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:43:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:43:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-02-08 08:43:31,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2025-02-08 08:43:31,185 INFO L175 Difference]: Start difference. First operand has 44 places, 53 transitions, 256 flow. Second operand 5 states and 116 transitions. [2025-02-08 08:43:31,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 92 transitions, 584 flow [2025-02-08 08:43:31,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 92 transitions, 574 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-02-08 08:43:31,191 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 274 flow [2025-02-08 08:43:31,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2025-02-08 08:43:31,191 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-02-08 08:43:31,191 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 274 flow [2025-02-08 08:43:31,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:43:31,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:31,192 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:43:31,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:43:31,192 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-08 08:43:31,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:31,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2077139496, now seen corresponding path program 1 times [2025-02-08 08:43:31,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:31,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436118829] [2025-02-08 08:43:31,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:31,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:43:31,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:43:31,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:31,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:31,374 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:43:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436118829] [2025-02-08 08:43:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436118829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:31,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:31,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:43:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212110419] [2025-02-08 08:43:31,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:31,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:43:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:31,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:43:31,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:43:31,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-08 08:43:31,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:43:31,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:31,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-08 08:43:31,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:31,626 INFO L124 PetriNetUnfolderBase]: 1641/2542 cut-off events. [2025-02-08 08:43:31,626 INFO L125 PetriNetUnfolderBase]: For 3547/3547 co-relation queries the response was YES. [2025-02-08 08:43:31,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 2542 events. 1641/2542 cut-off events. For 3547/3547 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13099 event pairs, 345 based on Foata normal form. 80/2614 useless extension candidates. Maximal degree in co-relation 5826. Up to 1629 conditions per place. [2025-02-08 08:43:31,640 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 79 selfloop transitions, 10 changer transitions 2/98 dead transitions. [2025-02-08 08:43:31,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 677 flow [2025-02-08 08:43:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:43:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:43:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2025-02-08 08:43:31,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2025-02-08 08:43:31,643 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 274 flow. Second operand 5 states and 115 transitions. [2025-02-08 08:43:31,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 677 flow [2025-02-08 08:43:31,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:43:31,653 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 313 flow [2025-02-08 08:43:31,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-02-08 08:43:31,653 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-02-08 08:43:31,653 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 313 flow [2025-02-08 08:43:31,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:43:31,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:31,654 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:43:31,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:43:31,654 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-08 08:43:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash 253251870, now seen corresponding path program 2 times [2025-02-08 08:43:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184134919] [2025-02-08 08:43:31,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:43:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:31,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:43:31,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:43:31,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:43:31,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:31,896 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:43:31,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:31,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184134919] [2025-02-08 08:43:31,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184134919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:31,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:31,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:43:31,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274821916] [2025-02-08 08:43:31,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:31,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:43:31,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:31,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:43:31,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:43:31,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-08 08:43:31,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:43:31,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:31,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-08 08:43:31,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:32,303 INFO L124 PetriNetUnfolderBase]: 2653/4072 cut-off events. [2025-02-08 08:43:32,304 INFO L125 PetriNetUnfolderBase]: For 6489/6489 co-relation queries the response was YES. [2025-02-08 08:43:32,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13771 conditions, 4072 events. 2653/4072 cut-off events. For 6489/6489 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22267 event pairs, 238 based on Foata normal form. 96/4163 useless extension candidates. Maximal degree in co-relation 7116. Up to 2403 conditions per place. [2025-02-08 08:43:32,324 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 104 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2025-02-08 08:43:32,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 123 transitions, 917 flow [2025-02-08 08:43:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:43:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:43:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-02-08 08:43:32,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2025-02-08 08:43:32,325 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 313 flow. Second operand 5 states and 125 transitions. [2025-02-08 08:43:32,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 123 transitions, 917 flow [2025-02-08 08:43:32,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 123 transitions, 884 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:43:32,335 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 447 flow [2025-02-08 08:43:32,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2025-02-08 08:43:32,336 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2025-02-08 08:43:32,336 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 447 flow [2025-02-08 08:43:32,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:43:32,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:32,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:43:32,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:43:32,336 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-08 08:43:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2093726913, now seen corresponding path program 1 times [2025-02-08 08:43:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019962340] [2025-02-08 08:43:32,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:32,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:43:32,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:43:32,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:32,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:32,527 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:43:32,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:32,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019962340] [2025-02-08 08:43:32,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019962340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:32,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:32,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:43:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94299215] [2025-02-08 08:43:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:32,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:43:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:32,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:43:32,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:43:32,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-02-08 08:43:32,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 447 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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:43:32,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:32,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-02-08 08:43:32,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:33,170 INFO L124 PetriNetUnfolderBase]: 3970/5825 cut-off events. [2025-02-08 08:43:33,170 INFO L125 PetriNetUnfolderBase]: For 19788/19788 co-relation queries the response was YES. [2025-02-08 08:43:33,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23075 conditions, 5825 events. 3970/5825 cut-off events. For 19788/19788 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 32100 event pairs, 70 based on Foata normal form. 310/5885 useless extension candidates. Maximal degree in co-relation 12518. Up to 1647 conditions per place. [2025-02-08 08:43:33,211 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 207 selfloop transitions, 41 changer transitions 0/254 dead transitions. [2025-02-08 08:43:33,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 254 transitions, 2424 flow [2025-02-08 08:43:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:43:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:43:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2025-02-08 08:43:33,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648648648648649 [2025-02-08 08:43:33,212 INFO L175 Difference]: Start difference. First operand has 59 places, 67 transitions, 447 flow. Second operand 10 states and 209 transitions. [2025-02-08 08:43:33,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 254 transitions, 2424 flow [2025-02-08 08:43:33,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 254 transitions, 2380 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-02-08 08:43:33,234 INFO L231 Difference]: Finished difference. Result has 74 places, 99 transitions, 828 flow [2025-02-08 08:43:33,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=828, PETRI_PLACES=74, PETRI_TRANSITIONS=99} [2025-02-08 08:43:33,234 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2025-02-08 08:43:33,234 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 99 transitions, 828 flow [2025-02-08 08:43:33,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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:43:33,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:33,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:43:33,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:43:33,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:43:33,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash 319636617, now seen corresponding path program 2 times [2025-02-08 08:43:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:33,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004737933] [2025-02-08 08:43:33,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:43:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:33,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:43:33,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:43:33,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:43:33,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:34,719 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:43:34,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:34,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004737933] [2025-02-08 08:43:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004737933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:34,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:43:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950885555] [2025-02-08 08:43:34,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:34,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:43:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:34,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:43:34,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:43:34,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-08 08:43:34,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 99 transitions, 828 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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:43:34,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:34,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-08 08:43:34,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:36,091 INFO L124 PetriNetUnfolderBase]: 5255/8031 cut-off events. [2025-02-08 08:43:36,091 INFO L125 PetriNetUnfolderBase]: For 40099/40178 co-relation queries the response was YES. [2025-02-08 08:43:36,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37410 conditions, 8031 events. 5255/8031 cut-off events. For 40099/40178 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 48824 event pairs, 429 based on Foata normal form. 84/8106 useless extension candidates. Maximal degree in co-relation 23185. Up to 4728 conditions per place. [2025-02-08 08:43:36,133 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 166 selfloop transitions, 54 changer transitions 56/285 dead transitions. [2025-02-08 08:43:36,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 285 transitions, 2837 flow [2025-02-08 08:43:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:43:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 08:43:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 275 transitions. [2025-02-08 08:43:36,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5717255717255717 [2025-02-08 08:43:36,135 INFO L175 Difference]: Start difference. First operand has 74 places, 99 transitions, 828 flow. Second operand 13 states and 275 transitions. [2025-02-08 08:43:36,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 285 transitions, 2837 flow [2025-02-08 08:43:36,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 285 transitions, 2837 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:43:36,182 INFO L231 Difference]: Finished difference. Result has 95 places, 149 transitions, 1535 flow [2025-02-08 08:43:36,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1535, PETRI_PLACES=95, PETRI_TRANSITIONS=149} [2025-02-08 08:43:36,184 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 55 predicate places. [2025-02-08 08:43:36,184 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 149 transitions, 1535 flow [2025-02-08 08:43:36,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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:43:36,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:36,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:43:36,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:43:36,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:43:36,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1760002343, now seen corresponding path program 3 times [2025-02-08 08:43:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:36,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305798047] [2025-02-08 08:43:36,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:43:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:36,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:43:36,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:43:36,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:43:36,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:37,395 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:43:37,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:37,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305798047] [2025-02-08 08:43:37,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305798047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:37,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:37,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:43:37,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624916476] [2025-02-08 08:43:37,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:37,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:43:37,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:37,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:43:37,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:43:37,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-02-08 08:43:37,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 149 transitions, 1535 flow. Second operand has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 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:43:37,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:37,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-02-08 08:43:37,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:39,386 INFO L124 PetriNetUnfolderBase]: 8419/12453 cut-off events. [2025-02-08 08:43:39,386 INFO L125 PetriNetUnfolderBase]: For 81464/81464 co-relation queries the response was YES. [2025-02-08 08:43:39,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65359 conditions, 12453 events. 8419/12453 cut-off events. For 81464/81464 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 76182 event pairs, 509 based on Foata normal form. 5/12455 useless extension candidates. Maximal degree in co-relation 65310. Up to 7063 conditions per place. [2025-02-08 08:43:39,501 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 228 selfloop transitions, 88 changer transitions 79/401 dead transitions. [2025-02-08 08:43:39,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 401 transitions, 4483 flow [2025-02-08 08:43:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:43:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 08:43:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 352 transitions. [2025-02-08 08:43:39,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5596184419713831 [2025-02-08 08:43:39,505 INFO L175 Difference]: Start difference. First operand has 95 places, 149 transitions, 1535 flow. Second operand 17 states and 352 transitions. [2025-02-08 08:43:39,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 401 transitions, 4483 flow [2025-02-08 08:43:39,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 401 transitions, 4397 flow, removed 43 selfloop flow, removed 2 redundant places. [2025-02-08 08:43:39,647 INFO L231 Difference]: Finished difference. Result has 119 places, 199 transitions, 2420 flow [2025-02-08 08:43:39,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2420, PETRI_PLACES=119, PETRI_TRANSITIONS=199} [2025-02-08 08:43:39,647 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 79 predicate places. [2025-02-08 08:43:39,648 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 199 transitions, 2420 flow [2025-02-08 08:43:39,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 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:43:39,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:39,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:43:39,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:43:39,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:43:39,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash -814594721, now seen corresponding path program 4 times [2025-02-08 08:43:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:39,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522324181] [2025-02-08 08:43:39,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:43:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:39,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-08 08:43:39,672 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:43:39,672 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:43:39,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522324181] [2025-02-08 08:43:40,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522324181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:43:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628068604] [2025-02-08 08:43:40,421 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:43:40,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:43:40,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:43:40,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:43:40,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:43:40,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-08 08:43:40,498 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:43:40,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:43:40,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:40,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 08:43:40,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:43:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:41,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:43:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:43:42,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628068604] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:43:42,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:43:42,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-02-08 08:43:42,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056180441] [2025-02-08 08:43:42,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:43:42,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 08:43:42,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:42,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 08:43:42,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2025-02-08 08:43:42,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-02-08 08:43:42,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 199 transitions, 2420 flow. Second operand has 25 states, 25 states have (on average 12.6) internal successors, (315), 25 states have internal predecessors, (315), 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:43:42,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:42,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-02-08 08:43:42,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:43:53,652 INFO L124 PetriNetUnfolderBase]: 32004/47329 cut-off events. [2025-02-08 08:43:53,652 INFO L125 PetriNetUnfolderBase]: For 476807/477444 co-relation queries the response was YES. [2025-02-08 08:43:54,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270817 conditions, 47329 events. 32004/47329 cut-off events. For 476807/477444 co-relation queries the response was YES. Maximal size of possible extension queue 2409. Compared 342307 event pairs, 616 based on Foata normal form. 654/47940 useless extension candidates. Maximal degree in co-relation 270712. Up to 10613 conditions per place. [2025-02-08 08:43:54,308 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 696 selfloop transitions, 474 changer transitions 288/1466 dead transitions. [2025-02-08 08:43:54,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1466 transitions, 18122 flow [2025-02-08 08:43:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-02-08 08:43:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2025-02-08 08:43:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 1403 transitions. [2025-02-08 08:43:54,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5340692805481538 [2025-02-08 08:43:54,315 INFO L175 Difference]: Start difference. First operand has 119 places, 199 transitions, 2420 flow. Second operand 71 states and 1403 transitions. [2025-02-08 08:43:54,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1466 transitions, 18122 flow [2025-02-08 08:43:55,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1466 transitions, 17757 flow, removed 172 selfloop flow, removed 4 redundant places. [2025-02-08 08:43:55,702 INFO L231 Difference]: Finished difference. Result has 215 places, 602 transitions, 9259 flow [2025-02-08 08:43:55,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=9259, PETRI_PLACES=215, PETRI_TRANSITIONS=602} [2025-02-08 08:43:55,703 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 175 predicate places. [2025-02-08 08:43:55,703 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 602 transitions, 9259 flow [2025-02-08 08:43:55,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.6) internal successors, (315), 25 states have internal predecessors, (315), 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:43:55,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:43:55,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:43:55,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:43:55,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:43:55,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:43:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:43:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1149738571, now seen corresponding path program 1 times [2025-02-08 08:43:55,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:43:55,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455894250] [2025-02-08 08:43:55,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:43:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:43:55,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:43:55,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:43:55,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:43:55,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:43:56,155 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:43:56,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:43:56,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455894250] [2025-02-08 08:43:56,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455894250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:43:56,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:43:56,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:43:56,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534915688] [2025-02-08 08:43:56,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:43:56,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:43:56,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:43:56,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:43:56,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:43:56,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-02-08 08:43:56,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 602 transitions, 9259 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:43:56,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:43:56,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-02-08 08:43:56,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:04,556 INFO L124 PetriNetUnfolderBase]: 35322/53820 cut-off events. [2025-02-08 08:44:04,557 INFO L125 PetriNetUnfolderBase]: For 889752/892820 co-relation queries the response was YES. [2025-02-08 08:44:05,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371135 conditions, 53820 events. 35322/53820 cut-off events. For 889752/892820 co-relation queries the response was YES. Maximal size of possible extension queue 2276. Compared 403876 event pairs, 3583 based on Foata normal form. 1136/54252 useless extension candidates. Maximal degree in co-relation 370723. Up to 31724 conditions per place. [2025-02-08 08:44:05,494 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 845 selfloop transitions, 146 changer transitions 0/1006 dead transitions. [2025-02-08 08:44:05,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 1006 transitions, 17336 flow [2025-02-08 08:44:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:44:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:44:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-02-08 08:44:05,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6293436293436293 [2025-02-08 08:44:05,495 INFO L175 Difference]: Start difference. First operand has 215 places, 602 transitions, 9259 flow. Second operand 7 states and 163 transitions. [2025-02-08 08:44:05,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 1006 transitions, 17336 flow [2025-02-08 08:44:14,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1006 transitions, 14357 flow, removed 1471 selfloop flow, removed 16 redundant places. [2025-02-08 08:44:14,795 INFO L231 Difference]: Finished difference. Result has 196 places, 711 transitions, 9327 flow [2025-02-08 08:44:14,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7545, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9327, PETRI_PLACES=196, PETRI_TRANSITIONS=711} [2025-02-08 08:44:14,796 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 156 predicate places. [2025-02-08 08:44:14,796 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 711 transitions, 9327 flow [2025-02-08 08:44:14,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:44:14,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:14,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:44:14,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:44:14,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:44:14,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1351145453, now seen corresponding path program 2 times [2025-02-08 08:44:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749608265] [2025-02-08 08:44:14,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:44:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:14,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:44:14,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:44:14,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:44:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:15,057 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:44:15,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:15,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749608265] [2025-02-08 08:44:15,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749608265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:44:15,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:44:15,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:44:15,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472742913] [2025-02-08 08:44:15,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:44:15,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:44:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:15,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:44:15,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:44:15,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-02-08 08:44:15,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 711 transitions, 9327 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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:44:15,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:44:15,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-02-08 08:44:15,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:44:28,658 INFO L124 PetriNetUnfolderBase]: 58921/87328 cut-off events. [2025-02-08 08:44:28,658 INFO L125 PetriNetUnfolderBase]: For 956855/961941 co-relation queries the response was YES. [2025-02-08 08:44:29,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512494 conditions, 87328 events. 58921/87328 cut-off events. For 956855/961941 co-relation queries the response was YES. Maximal size of possible extension queue 3256. Compared 658799 event pairs, 7701 based on Foata normal form. 1606/87898 useless extension candidates. Maximal degree in co-relation 485810. Up to 51958 conditions per place. [2025-02-08 08:44:30,224 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 854 selfloop transitions, 367 changer transitions 0/1235 dead transitions. [2025-02-08 08:44:30,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1235 transitions, 18013 flow [2025-02-08 08:44:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 08:44:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 08:44:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 415 transitions. [2025-02-08 08:44:30,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-02-08 08:44:30,226 INFO L175 Difference]: Start difference. First operand has 196 places, 711 transitions, 9327 flow. Second operand 20 states and 415 transitions. [2025-02-08 08:44:30,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1235 transitions, 18013 flow [2025-02-08 08:44:37,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 1235 transitions, 17759 flow, removed 103 selfloop flow, removed 2 redundant places. [2025-02-08 08:44:37,240 INFO L231 Difference]: Finished difference. Result has 223 places, 964 transitions, 14112 flow [2025-02-08 08:44:37,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9145, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=14112, PETRI_PLACES=223, PETRI_TRANSITIONS=964} [2025-02-08 08:44:37,241 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 183 predicate places. [2025-02-08 08:44:37,241 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 964 transitions, 14112 flow [2025-02-08 08:44:37,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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:44:37,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:44:37,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:44:37,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:44:37,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:44:37,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:44:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1432264930, now seen corresponding path program 5 times [2025-02-08 08:44:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:44:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535560700] [2025-02-08 08:44:37,242 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:44:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:44:37,246 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 08:44:37,259 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:44:37,260 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:44:37,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:44:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:44:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535560700] [2025-02-08 08:44:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535560700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:44:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205574320] [2025-02-08 08:44:38,430 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:44:38,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:44:38,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:44:38,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:44:38,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:44:38,462 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 08:44:38,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:44:38,524 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:44:38,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:44:38,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 08:44:38,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:44:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:44:55,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:44:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:44:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205574320] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:44:56,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:44:56,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-02-08 08:44:56,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728359812] [2025-02-08 08:44:56,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:44:56,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 08:44:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:44:56,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 08:44:56,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=513, Unknown=4, NotChecked=0, Total=650 [2025-02-08 08:45:00,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 08:45:00,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-02-08 08:45:00,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 964 transitions, 14112 flow. Second operand has 26 states, 26 states have (on average 11.846153846153847) internal successors, (308), 26 states have internal predecessors, (308), 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:45:00,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:00,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-02-08 08:45:00,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand