./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:45:25,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:45:25,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:45:25,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:45:25,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:45:25,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:45:25,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:45:25,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:45:25,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:45:25,550 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:45:25,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:45:25,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:45:25,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:45:25,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:45:25,551 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:45:25,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:45:25,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:45:25,553 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:45:25,553 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:45:25,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:45:25,553 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:45:25,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:45:25,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:45:25,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:45:25,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:45:25,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:45:25,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:45:25,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:45:25,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:45:25,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:45:25,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:45:25,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:45:25,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:45:25,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:45:25,554 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/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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-03-04 09:45:25,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:45:25,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:45:25,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:45:25,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:45:25,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:45:25,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-03-04 09:45:26,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e6ae8e7/b4b2178dd5964d588055388b61c0f2d6/FLAGf20832b82 [2025-03-04 09:45:27,203 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:45:27,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-03-04 09:45:27,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e6ae8e7/b4b2178dd5964d588055388b61c0f2d6/FLAGf20832b82 [2025-03-04 09:45:27,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e6ae8e7/b4b2178dd5964d588055388b61c0f2d6 [2025-03-04 09:45:27,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:45:27,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:45:27,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:45:27,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:45:27,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:45:27,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0d30d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27, skipping insertion in model container [2025-03-04 09:45:27,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:45:27,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:45:27,778 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:45:27,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:45:27,834 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:45:27,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27 WrapperNode [2025-03-04 09:45:27,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:45:27,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:45:27,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:45:27,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:45:27,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,856 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-04 09:45:27,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:45:27,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:45:27,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:45:27,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:45:27,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,874 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-04 09:45:27,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:45:27,881 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:45:27,881 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:45:27,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:45:27,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (1/1) ... [2025-03-04 09:45:27,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:45:27,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:45:27,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:45:27,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:45:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-04 09:45:27,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-04 09:45:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 09:45:27,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 09:45:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:45:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:45:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:45:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:45:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:45:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:45:27,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:45:27,921 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:45:27,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:45:27,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:45:28,114 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:45:28,114 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:45:28,187 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:45:28,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:45:28,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:45:28 BoogieIcfgContainer [2025-03-04 09:45:28,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:45:28,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:45:28,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:45:28,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:45:28,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:45:27" (1/3) ... [2025-03-04 09:45:28,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422c844a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:45:28, skipping insertion in model container [2025-03-04 09:45:28,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:45:27" (2/3) ... [2025-03-04 09:45:28,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422c844a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:45:28, skipping insertion in model container [2025-03-04 09:45:28,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:45:28" (3/3) ... [2025-03-04 09:45:28,195 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-03-04 09:45:28,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:45:28,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 26 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-04 09:45:28,208 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:45:28,232 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:28,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 68 flow [2025-03-04 09:45:28,281 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-03-04 09:45:28,284 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:28,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-04 09:45:28,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 68 flow [2025-03-04 09:45:28,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 65 flow [2025-03-04 09:45:28,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:28,304 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;@4350003b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:28,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 09:45:28,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:28,308 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-04 09:45:28,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:28,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:28,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:45:28,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:45:28,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:28,315 INFO L85 PathProgramCache]: Analyzing trace with hash 160476854, now seen corresponding path program 1 times [2025-03-04 09:45:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001360798] [2025-03-04 09:45:28,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:28,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:28,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:45:28,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:45:28,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:28,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:28,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:28,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001360798] [2025-03-04 09:45:28,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001360798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:28,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:28,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:28,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003154486] [2025-03-04 09:45:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:28,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:28,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:28,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:28,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 09:45:28,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 65 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-03-04 09:45:28,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:28,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 09:45:28,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:28,515 INFO L124 PetriNetUnfolderBase]: 79/165 cut-off events. [2025-03-04 09:45:28,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:28,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 165 events. 79/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 694 event pairs, 66 based on Foata normal form. 29/186 useless extension candidates. Maximal degree in co-relation 304. Up to 136 conditions per place. [2025-03-04 09:45:28,520 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 12 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-03-04 09:45:28,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 73 flow [2025-03-04 09:45:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-03-04 09:45:28,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 09:45:28,531 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 65 flow. Second operand 2 states and 39 transitions. [2025-03-04 09:45:28,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 73 flow [2025-03-04 09:45:28,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:28,537 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 48 flow [2025-03-04 09:45:28,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-03-04 09:45:28,542 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -6 predicate places. [2025-03-04 09:45:28,542 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 48 flow [2025-03-04 09:45:28,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-03-04 09:45:28,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:28,542 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:28,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:45:28,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:45:28,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 469317030, now seen corresponding path program 1 times [2025-03-04 09:45:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:28,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4183048] [2025-03-04 09:45:28,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:28,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:28,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:45:28,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:45:28,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:28,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:28,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:28,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:45:28,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:45:28,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:28,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:28,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:28,598 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:28,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 09:45:28,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-04 09:45:28,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-03-04 09:45:28,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-04 09:45:28,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-04 09:45:28,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:45:28,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 09:45:28,603 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:28,603 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:45:28,628 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:28,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 122 flow [2025-03-04 09:45:28,640 INFO L124 PetriNetUnfolderBase]: 5/45 cut-off events. [2025-03-04 09:45:28,640 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:45:28,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 45 events. 5/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 52. Up to 3 conditions per place. [2025-03-04 09:45:28,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 51 transitions, 122 flow [2025-03-04 09:45:28,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 36 transitions, 85 flow [2025-03-04 09:45:28,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:28,643 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;@4350003b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:28,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 09:45:28,645 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:28,645 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 09:45:28,645 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:28,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:28,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:45:28,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:45:28,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash 209712438, now seen corresponding path program 1 times [2025-03-04 09:45:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:28,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665654977] [2025-03-04 09:45:28,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:28,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:45:28,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:45:28,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:28,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:28,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:28,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665654977] [2025-03-04 09:45:28,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665654977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:28,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150375126] [2025-03-04 09:45:28,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:28,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:28,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:28,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:28,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:28,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2025-03-04 09:45:28,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 85 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-03-04 09:45:28,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:28,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2025-03-04 09:45:28,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:28,809 INFO L124 PetriNetUnfolderBase]: 559/917 cut-off events. [2025-03-04 09:45:28,810 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 09:45:28,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 917 events. 559/917 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4565 event pairs, 450 based on Foata normal form. 125/1026 useless extension candidates. Maximal degree in co-relation 1768. Up to 800 conditions per place. [2025-03-04 09:45:28,818 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-03-04 09:45:28,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 99 flow [2025-03-04 09:45:28,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2025-03-04 09:45:28,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-03-04 09:45:28,820 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 85 flow. Second operand 2 states and 60 transitions. [2025-03-04 09:45:28,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 99 flow [2025-03-04 09:45:28,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:28,821 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 66 flow [2025-03-04 09:45:28,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-03-04 09:45:28,822 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2025-03-04 09:45:28,822 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 66 flow [2025-03-04 09:45:28,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-03-04 09:45:28,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:28,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:28,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:45:28,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:45:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash -558814368, now seen corresponding path program 1 times [2025-03-04 09:45:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197478811] [2025-03-04 09:45:28,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:28,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:28,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:45:28,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:45:28,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:28,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:28,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197478811] [2025-03-04 09:45:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197478811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:28,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:28,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194923184] [2025-03-04 09:45:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:28,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:45:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:28,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:45:28,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:45:28,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2025-03-04 09:45:28,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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-03-04 09:45:28,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:28,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2025-03-04 09:45:28,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:29,015 INFO L124 PetriNetUnfolderBase]: 620/1065 cut-off events. [2025-03-04 09:45:29,015 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 09:45:29,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 1065 events. 620/1065 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5742 event pairs, 139 based on Foata normal form. 20/1076 useless extension candidates. Maximal degree in co-relation 2026. Up to 760 conditions per place. [2025-03-04 09:45:29,021 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 22 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-03-04 09:45:29,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 139 flow [2025-03-04 09:45:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 09:45:29,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5424836601307189 [2025-03-04 09:45:29,023 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 66 flow. Second operand 3 states and 83 transitions. [2025-03-04 09:45:29,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 139 flow [2025-03-04 09:45:29,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 139 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:29,026 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 85 flow [2025-03-04 09:45:29,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-03-04 09:45:29,027 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2025-03-04 09:45:29,027 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 85 flow [2025-03-04 09:45:29,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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-03-04 09:45:29,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:29,027 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:29,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:45:29,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:45:29,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash 79765765, now seen corresponding path program 1 times [2025-03-04 09:45:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:29,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689206912] [2025-03-04 09:45:29,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:29,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:45:29,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:45:29,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:29,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:29,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:29,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:45:29,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:45:29,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:29,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:29,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:29,051 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:29,051 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 09:45:29,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-04 09:45:29,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-04 09:45:29,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 09:45:29,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-04 09:45:29,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-04 09:45:29,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:45:29,052 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 09:45:29,058 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:29,059 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:45:29,099 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:29,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 72 transitions, 180 flow [2025-03-04 09:45:29,107 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-03-04 09:45:29,107 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:45:29,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 57 events. 6/57 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 146 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2025-03-04 09:45:29,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 72 transitions, 180 flow [2025-03-04 09:45:29,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 43 transitions, 107 flow [2025-03-04 09:45:29,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:29,111 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;@4350003b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:29,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:45:29,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:29,114 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-04 09:45:29,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:29,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:29,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:45:29,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:45:29,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash 278988427, now seen corresponding path program 1 times [2025-03-04 09:45:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233099653] [2025-03-04 09:45:29,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:29,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:45:29,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:45:29,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:29,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233099653] [2025-03-04 09:45:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233099653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:29,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:29,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:29,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034119536] [2025-03-04 09:45:29,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:29,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:29,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:29,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 72 [2025-03-04 09:45:29,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 107 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:29,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:29,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 72 [2025-03-04 09:45:29,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:29,511 INFO L124 PetriNetUnfolderBase]: 3247/4709 cut-off events. [2025-03-04 09:45:29,511 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2025-03-04 09:45:29,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9252 conditions, 4709 events. 3247/4709 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 25624 event pairs, 2562 based on Foata normal form. 509/5154 useless extension candidates. Maximal degree in co-relation 9240. Up to 4224 conditions per place. [2025-03-04 09:45:29,534 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 20 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2025-03-04 09:45:29,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 127 flow [2025-03-04 09:45:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2025-03-04 09:45:29,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 09:45:29,535 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 107 flow. Second operand 2 states and 81 transitions. [2025-03-04 09:45:29,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 127 flow [2025-03-04 09:45:29,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 124 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:29,536 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 84 flow [2025-03-04 09:45:29,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-03-04 09:45:29,537 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2025-03-04 09:45:29,537 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 84 flow [2025-03-04 09:45:29,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:29,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:29,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:29,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:45:29,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:45:29,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1835444083, now seen corresponding path program 1 times [2025-03-04 09:45:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:29,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383968043] [2025-03-04 09:45:29,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:29,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:45:29,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:45:29,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:29,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383968043] [2025-03-04 09:45:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383968043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119063405] [2025-03-04 09:45:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:29,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:45:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:29,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:45:29,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:45:29,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 72 [2025-03-04 09:45:29,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:29,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:29,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 72 [2025-03-04 09:45:29,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:29,942 INFO L124 PetriNetUnfolderBase]: 3515/5256 cut-off events. [2025-03-04 09:45:29,942 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2025-03-04 09:45:29,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10162 conditions, 5256 events. 3515/5256 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 30729 event pairs, 724 based on Foata normal form. 44/5276 useless extension candidates. Maximal degree in co-relation 10156. Up to 4267 conditions per place. [2025-03-04 09:45:29,975 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 28 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-04 09:45:29,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2025-03-04 09:45:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-03-04 09:45:29,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-04 09:45:29,979 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 84 flow. Second operand 3 states and 114 transitions. [2025-03-04 09:45:29,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2025-03-04 09:45:29,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:29,980 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 110 flow [2025-03-04 09:45:29,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-03-04 09:45:29,980 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2025-03-04 09:45:29,981 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 110 flow [2025-03-04 09:45:29,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:29,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:29,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:29,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:45:29,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:45:29,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash 973536846, now seen corresponding path program 1 times [2025-03-04 09:45:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:29,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127910886] [2025-03-04 09:45:29,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:29,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:45:29,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:45:29,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:29,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:30,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127910886] [2025-03-04 09:45:30,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127910886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:30,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:30,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:45:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468838653] [2025-03-04 09:45:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:30,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:45:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:30,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:45:30,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:45:30,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 72 [2025-03-04 09:45:30,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-03-04 09:45:30,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:30,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 72 [2025-03-04 09:45:30,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:30,163 INFO L124 PetriNetUnfolderBase]: 456/1058 cut-off events. [2025-03-04 09:45:30,163 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-03-04 09:45:30,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 1058 events. 456/1058 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6231 event pairs, 102 based on Foata normal form. 618/1657 useless extension candidates. Maximal degree in co-relation 2274. Up to 633 conditions per place. [2025-03-04 09:45:30,169 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 21 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2025-03-04 09:45:30,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 193 flow [2025-03-04 09:45:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-04 09:45:30,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-03-04 09:45:30,171 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 110 flow. Second operand 3 states and 111 transitions. [2025-03-04 09:45:30,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 193 flow [2025-03-04 09:45:30,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:30,172 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 122 flow [2025-03-04 09:45:30,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-03-04 09:45:30,173 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-03-04 09:45:30,173 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 122 flow [2025-03-04 09:45:30,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-03-04 09:45:30,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:30,173 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:30,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:45:30,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:45:30,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash -694755605, now seen corresponding path program 1 times [2025-03-04 09:45:30,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:30,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733203887] [2025-03-04 09:45:30,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:30,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:45:30,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:45:30,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:30,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:30,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:30,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:45:30,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:45:30,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:30,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:30,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:30,191 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:30,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 09:45:30,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:45:30,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:45:30,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 09:45:30,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-04 09:45:30,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 09:45:30,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:45:30,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:45:30,192 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 09:45:30,193 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:30,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 09:45:30,215 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:30,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 93 transitions, 242 flow [2025-03-04 09:45:30,222 INFO L124 PetriNetUnfolderBase]: 7/69 cut-off events. [2025-03-04 09:45:30,222 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:45:30,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 69 events. 7/69 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 171 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 85. Up to 5 conditions per place. [2025-03-04 09:45:30,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 93 transitions, 242 flow [2025-03-04 09:45:30,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 50 transitions, 131 flow [2025-03-04 09:45:30,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:30,224 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;@4350003b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:30,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:45:30,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:30,225 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 09:45:30,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:30,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:30,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:45:30,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 09:45:30,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash 368304821, now seen corresponding path program 1 times [2025-03-04 09:45:30,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:30,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001508873] [2025-03-04 09:45:30,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:30,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:45:30,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:45:30,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:30,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:30,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001508873] [2025-03-04 09:45:30,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001508873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:30,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:30,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220439778] [2025-03-04 09:45:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:30,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:30,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:30,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:30,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:30,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-03-04 09:45:30,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 131 flow. Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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-03-04 09:45:30,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:30,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-03-04 09:45:30,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:31,541 INFO L124 PetriNetUnfolderBase]: 17071/22949 cut-off events. [2025-03-04 09:45:31,541 INFO L125 PetriNetUnfolderBase]: For 4208/4208 co-relation queries the response was YES. [2025-03-04 09:45:31,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45541 conditions, 22949 events. 17071/22949 cut-off events. For 4208/4208 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 131072 event pairs, 13314 based on Foata normal form. 2045/24735 useless extension candidates. Maximal degree in co-relation 45528. Up to 20992 conditions per place. [2025-03-04 09:45:31,690 INFO L140 encePairwiseOnDemand]: 85/93 looper letters, 24 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-03-04 09:45:31,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 157 flow [2025-03-04 09:45:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2025-03-04 09:45:31,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-03-04 09:45:31,693 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 131 flow. Second operand 2 states and 102 transitions. [2025-03-04 09:45:31,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 157 flow [2025-03-04 09:45:31,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 150 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:31,698 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 102 flow [2025-03-04 09:45:31,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-03-04 09:45:31,698 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -9 predicate places. [2025-03-04 09:45:31,699 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 102 flow [2025-03-04 09:45:31,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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-03-04 09:45:31,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:31,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:31,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:45:31,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 09:45:31,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash 342592230, now seen corresponding path program 1 times [2025-03-04 09:45:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:31,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214584770] [2025-03-04 09:45:31,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:31,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:45:31,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:45:31,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:31,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:31,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:31,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214584770] [2025-03-04 09:45:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214584770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:31,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515370003] [2025-03-04 09:45:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:31,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:45:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:31,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:45:31,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:45:31,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-03-04 09:45:31,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-03-04 09:45:31,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:31,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-03-04 09:45:31,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:32,934 INFO L124 PetriNetUnfolderBase]: 17930/24627 cut-off events. [2025-03-04 09:45:32,934 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2025-03-04 09:45:32,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47981 conditions, 24627 events. 17930/24627 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 148646 event pairs, 3961 based on Foata normal form. 92/24654 useless extension candidates. Maximal degree in co-relation 47974. Up to 21382 conditions per place. [2025-03-04 09:45:33,046 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 34 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-04 09:45:33,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 225 flow [2025-03-04 09:45:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-03-04 09:45:33,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5197132616487455 [2025-03-04 09:45:33,048 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 102 flow. Second operand 3 states and 145 transitions. [2025-03-04 09:45:33,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 225 flow [2025-03-04 09:45:33,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:33,050 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 135 flow [2025-03-04 09:45:33,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-03-04 09:45:33,051 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -6 predicate places. [2025-03-04 09:45:33,051 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 135 flow [2025-03-04 09:45:33,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-03-04 09:45:33,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:33,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:33,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:45:33,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 09:45:33,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1227801183, now seen corresponding path program 1 times [2025-03-04 09:45:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:33,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206678890] [2025-03-04 09:45:33,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:33,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:33,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:45:33,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:45:33,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:33,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:33,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:33,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206678890] [2025-03-04 09:45:33,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206678890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:33,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:33,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:45:33,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046492471] [2025-03-04 09:45:33,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:33,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:45:33,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:33,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:45:33,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:45:33,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-03-04 09:45:33,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-03-04 09:45:33,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:33,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-03-04 09:45:33,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:33,261 INFO L124 PetriNetUnfolderBase]: 1187/2606 cut-off events. [2025-03-04 09:45:33,261 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-03-04 09:45:33,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5685 conditions, 2606 events. 1187/2606 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17773 event pairs, 260 based on Foata normal form. 2076/4644 useless extension candidates. Maximal degree in co-relation 5676. Up to 1627 conditions per place. [2025-03-04 09:45:33,275 INFO L140 encePairwiseOnDemand]: 83/93 looper letters, 25 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2025-03-04 09:45:33,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 237 flow [2025-03-04 09:45:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-03-04 09:45:33,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2025-03-04 09:45:33,277 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 135 flow. Second operand 3 states and 141 transitions. [2025-03-04 09:45:33,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 237 flow [2025-03-04 09:45:33,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:33,278 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 150 flow [2025-03-04 09:45:33,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-03-04 09:45:33,279 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2025-03-04 09:45:33,279 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 150 flow [2025-03-04 09:45:33,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-03-04 09:45:33,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:33,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:33,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:45:33,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 09:45:33,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1172959277, now seen corresponding path program 1 times [2025-03-04 09:45:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062264403] [2025-03-04 09:45:33,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:33,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:45:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:45:33,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:33,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062264403] [2025-03-04 09:45:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062264403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:45:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676965744] [2025-03-04 09:45:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:33,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:33,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:33,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:33,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:33,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-03-04 09:45:33,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-03-04 09:45:33,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:33,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-03-04 09:45:33,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:33,661 INFO L124 PetriNetUnfolderBase]: 1731/3693 cut-off events. [2025-03-04 09:45:33,662 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2025-03-04 09:45:33,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9330 conditions, 3693 events. 1731/3693 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 26852 event pairs, 86 based on Foata normal form. 30/3713 useless extension candidates. Maximal degree in co-relation 9321. Up to 2243 conditions per place. [2025-03-04 09:45:33,680 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 49 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2025-03-04 09:45:33,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 396 flow [2025-03-04 09:45:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:45:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:45:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-04 09:45:33,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5349462365591398 [2025-03-04 09:45:33,682 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 150 flow. Second operand 4 states and 199 transitions. [2025-03-04 09:45:33,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 396 flow [2025-03-04 09:45:33,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:33,690 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 192 flow [2025-03-04 09:45:33,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-03-04 09:45:33,690 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2025-03-04 09:45:33,690 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 192 flow [2025-03-04 09:45:33,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-03-04 09:45:33,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:33,691 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:33,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:45:33,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 09:45:33,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1157774699, now seen corresponding path program 1 times [2025-03-04 09:45:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813365369] [2025-03-04 09:45:33,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:33,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:45:33,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:45:33,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:33,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:33,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:33,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:45:33,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:45:33,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:33,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:33,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:33,713 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:33,713 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 09:45:33,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-04 09:45:33,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-03-04 09:45:33,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-03-04 09:45:33,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-04 09:45:33,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-03-04 09:45:33,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-03-04 09:45:33,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-04 09:45:33,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:45:33,714 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 09:45:33,715 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:33,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 09:45:33,751 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:33,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 114 transitions, 308 flow [2025-03-04 09:45:33,758 INFO L124 PetriNetUnfolderBase]: 8/81 cut-off events. [2025-03-04 09:45:33,758 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 09:45:33,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 81 events. 8/81 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 103. Up to 6 conditions per place. [2025-03-04 09:45:33,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 114 transitions, 308 flow [2025-03-04 09:45:33,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 57 transitions, 157 flow [2025-03-04 09:45:33,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:33,760 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;@4350003b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:33,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 09:45:33,761 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:33,761 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-04 09:45:33,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:33,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:33,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:45:33,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 09:45:33,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash 477661620, now seen corresponding path program 1 times [2025-03-04 09:45:33,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:33,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080940597] [2025-03-04 09:45:33,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:33,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:45:33,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:45:33,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:33,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:33,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:33,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080940597] [2025-03-04 09:45:33,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080940597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:33,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:33,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:33,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350209120] [2025-03-04 09:45:33,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:33,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:33,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:33,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:33,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:33,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-03-04 09:45:33,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 157 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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-03-04 09:45:33,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:33,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-03-04 09:45:33,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:39,470 INFO L124 PetriNetUnfolderBase]: 84655/108197 cut-off events. [2025-03-04 09:45:39,470 INFO L125 PetriNetUnfolderBase]: For 26992/26992 co-relation queries the response was YES. [2025-03-04 09:45:39,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216294 conditions, 108197 events. 84655/108197 cut-off events. For 26992/26992 co-relation queries the response was YES. Maximal size of possible extension queue 3658. Compared 634686 event pairs, 65538 based on Foata normal form. 8189/115358 useless extension candidates. Maximal degree in co-relation 216280. Up to 100352 conditions per place. [2025-03-04 09:45:40,119 INFO L140 encePairwiseOnDemand]: 105/114 looper letters, 28 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2025-03-04 09:45:40,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 189 flow [2025-03-04 09:45:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:45:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:45:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 123 transitions. [2025-03-04 09:45:40,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-03-04 09:45:40,121 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 157 flow. Second operand 2 states and 123 transitions. [2025-03-04 09:45:40,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 189 flow [2025-03-04 09:45:40,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 176 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:40,131 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 120 flow [2025-03-04 09:45:40,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2025-03-04 09:45:40,132 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2025-03-04 09:45:40,132 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 120 flow [2025-03-04 09:45:40,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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-03-04 09:45:40,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:40,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:40,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:45:40,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 09:45:40,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1896157415, now seen corresponding path program 1 times [2025-03-04 09:45:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:40,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130200618] [2025-03-04 09:45:40,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:40,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:45:40,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:45:40,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:40,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130200618] [2025-03-04 09:45:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130200618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:40,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79490247] [2025-03-04 09:45:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:40,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:45:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:40,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:45:40,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:45:40,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-03-04 09:45:40,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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-03-04 09:45:40,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:40,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-03-04 09:45:40,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:45,812 INFO L124 PetriNetUnfolderBase]: 87029/112962 cut-off events. [2025-03-04 09:45:45,813 INFO L125 PetriNetUnfolderBase]: For 5082/5082 co-relation queries the response was YES. [2025-03-04 09:45:46,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221184 conditions, 112962 events. 87029/112962 cut-off events. For 5082/5082 co-relation queries the response was YES. Maximal size of possible extension queue 3946. Compared 694274 event pairs, 21478 based on Foata normal form. 188/112985 useless extension candidates. Maximal degree in co-relation 221176. Up to 101893 conditions per place. [2025-03-04 09:45:46,604 INFO L140 encePairwiseOnDemand]: 107/114 looper letters, 40 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-03-04 09:45:46,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 268 flow [2025-03-04 09:45:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-04 09:45:46,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5146198830409356 [2025-03-04 09:45:46,605 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 120 flow. Second operand 3 states and 176 transitions. [2025-03-04 09:45:46,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 268 flow [2025-03-04 09:45:46,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:45:46,614 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 160 flow [2025-03-04 09:45:46,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-03-04 09:45:46,615 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-03-04 09:45:46,615 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 160 flow [2025-03-04 09:45:46,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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-03-04 09:45:46,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:46,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:46,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:45:46,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 09:45:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -999283010, now seen corresponding path program 1 times [2025-03-04 09:45:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:46,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096914484] [2025-03-04 09:45:46,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:46,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:46,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:45:46,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:45:46,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:46,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096914484] [2025-03-04 09:45:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096914484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:45:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711144147] [2025-03-04 09:45:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:46,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:45:46,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:46,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:45:46,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:45:46,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-03-04 09:45:46,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:46,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:46,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-03-04 09:45:46,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:47,144 INFO L124 PetriNetUnfolderBase]: 2900/6134 cut-off events. [2025-03-04 09:45:47,145 INFO L125 PetriNetUnfolderBase]: For 1688/1688 co-relation queries the response was YES. [2025-03-04 09:45:47,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13498 conditions, 6134 events. 2900/6134 cut-off events. For 1688/1688 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 47531 event pairs, 648 based on Foata normal form. 6162/12223 useless extension candidates. Maximal degree in co-relation 13488. Up to 3945 conditions per place. [2025-03-04 09:45:47,177 INFO L140 encePairwiseOnDemand]: 102/114 looper letters, 29 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2025-03-04 09:45:47,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 281 flow [2025-03-04 09:45:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:45:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:45:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2025-03-04 09:45:47,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 09:45:47,178 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 160 flow. Second operand 3 states and 171 transitions. [2025-03-04 09:45:47,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 281 flow [2025-03-04 09:45:47,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:47,185 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 178 flow [2025-03-04 09:45:47,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-04 09:45:47,186 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2025-03-04 09:45:47,186 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 178 flow [2025-03-04 09:45:47,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:47,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:47,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:47,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:45:47,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 09:45:47,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2117122014, now seen corresponding path program 1 times [2025-03-04 09:45:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849026484] [2025-03-04 09:45:47,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:47,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:45:47,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:45:47,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:47,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:47,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849026484] [2025-03-04 09:45:47,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849026484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:47,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:47,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:45:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360391089] [2025-03-04 09:45:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:47,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:45:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:47,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:45:47,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:45:47,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-03-04 09:45:47,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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-03-04 09:45:47,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:47,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-03-04 09:45:47,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:47,623 INFO L124 PetriNetUnfolderBase]: 4045/8234 cut-off events. [2025-03-04 09:45:47,623 INFO L125 PetriNetUnfolderBase]: For 2462/2462 co-relation queries the response was YES. [2025-03-04 09:45:47,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21130 conditions, 8234 events. 4045/8234 cut-off events. For 2462/2462 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 65253 event pairs, 162 based on Foata normal form. 45/8266 useless extension candidates. Maximal degree in co-relation 21120. Up to 5638 conditions per place. [2025-03-04 09:45:47,664 INFO L140 encePairwiseOnDemand]: 107/114 looper letters, 58 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2025-03-04 09:45:47,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 476 flow [2025-03-04 09:45:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:45:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:45:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2025-03-04 09:45:47,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5307017543859649 [2025-03-04 09:45:47,665 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 178 flow. Second operand 4 states and 242 transitions. [2025-03-04 09:45:47,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 476 flow [2025-03-04 09:45:47,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:45:47,674 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 230 flow [2025-03-04 09:45:47,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-03-04 09:45:47,674 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2025-03-04 09:45:47,674 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 230 flow [2025-03-04 09:45:47,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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-03-04 09:45:47,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:47,675 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:47,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:45:47,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 09:45:47,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash 561115777, now seen corresponding path program 1 times [2025-03-04 09:45:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174529698] [2025-03-04 09:45:47,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:47,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:45:47,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:45:47,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:47,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:47,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174529698] [2025-03-04 09:45:47,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174529698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:45:47,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367631097] [2025-03-04 09:45:47,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:47,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:45:47,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:45:47,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:45:47,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:45:47,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:45:47,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:45:47,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:47,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:47,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 09:45:47,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:45:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:47,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:45:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367631097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:45:47,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:45:47,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 09:45:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433519307] [2025-03-04 09:45:47,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:45:47,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:45:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:47,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:45:47,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:45:47,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 114 [2025-03-04 09:45:47,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 230 flow. Second operand has 11 states, 11 states have (on average 41.54545454545455) internal successors, (457), 11 states have internal predecessors, (457), 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-03-04 09:45:47,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:47,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 114 [2025-03-04 09:45:47,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:49,185 INFO L124 PetriNetUnfolderBase]: 10827/20156 cut-off events. [2025-03-04 09:45:49,185 INFO L125 PetriNetUnfolderBase]: For 9660/9664 co-relation queries the response was YES. [2025-03-04 09:45:49,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50435 conditions, 20156 events. 10827/20156 cut-off events. For 9660/9664 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 166824 event pairs, 2132 based on Foata normal form. 513/20657 useless extension candidates. Maximal degree in co-relation 50423. Up to 6688 conditions per place. [2025-03-04 09:45:49,302 INFO L140 encePairwiseOnDemand]: 107/114 looper letters, 60 selfloop transitions, 26 changer transitions 0/100 dead transitions. [2025-03-04 09:45:49,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 592 flow [2025-03-04 09:45:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:45:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:45:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-03-04 09:45:49,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47192982456140353 [2025-03-04 09:45:49,303 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 230 flow. Second operand 5 states and 269 transitions. [2025-03-04 09:45:49,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 592 flow [2025-03-04 09:45:49,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 570 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 09:45:49,316 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 310 flow [2025-03-04 09:45:49,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2025-03-04 09:45:49,317 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2025-03-04 09:45:49,317 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 310 flow [2025-03-04 09:45:49,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.54545454545455) internal successors, (457), 11 states have internal predecessors, (457), 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-03-04 09:45:49,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:49,317 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:49,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:45:49,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:45:49,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 09:45:49,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash -218110352, now seen corresponding path program 1 times [2025-03-04 09:45:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:49,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086126706] [2025-03-04 09:45:49,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:49,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:45:49,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:45:49,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:49,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:49,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:45:49,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:45:49,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:45:49,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:49,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:45:49,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:45:49,545 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-03-04 09:45:49,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-03-04 09:45:49,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:45:49,547 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 09:45:49,547 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:45:49,547 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-04 09:45:49,573 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:45:49,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 378 flow [2025-03-04 09:45:49,579 INFO L124 PetriNetUnfolderBase]: 9/93 cut-off events. [2025-03-04 09:45:49,579 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 09:45:49,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 93 events. 9/93 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 252 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 122. Up to 7 conditions per place. [2025-03-04 09:45:49,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 135 transitions, 378 flow [2025-03-04 09:45:49,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 64 transitions, 185 flow [2025-03-04 09:45:49,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:45:49,582 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;@4350003b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:45:49,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 09:45:49,583 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:45:49,583 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-04 09:45:49,583 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:45:49,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:49,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 09:45:49,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-03-04 09:45:49,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash 607058824, now seen corresponding path program 1 times [2025-03-04 09:45:49,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:45:49,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433214523] [2025-03-04 09:45:49,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:45:49,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:45:49,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 09:45:49,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 09:45:49,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:49,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:49,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:45:49,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433214523] [2025-03-04 09:45:49,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433214523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:45:49,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:45:49,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:45:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838073641] [2025-03-04 09:45:49,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:45:49,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:45:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:45:49,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:45:49,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:45:49,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 135 [2025-03-04 09:45:49,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 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-03-04 09:45:49,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:49,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 135 [2025-03-04 09:45:49,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand