./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 14:01:51,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:01:51,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:01:51,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:01:51,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:01:51,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:01:51,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:01:51,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:01:51,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:01:51,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:01:51,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:01:51,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:01:51,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:01:51,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:01:51,412 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:01:51,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:01:51,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:01:51,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:01:51,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:01:51,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:01:51,412 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:01:51,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:01:51,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:01:51,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:01:51,413 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-17 14:01:51,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:01:51,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:01:51,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:01:51,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:01:51,629 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:01:51,630 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-17 14:01:52,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6a77f7e/4efb7b8afbcc48019c0c5fc9bdca666f/FLAGaa50a1cbc [2025-03-17 14:01:53,058 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:01:53,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-03-17 14:01:53,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6a77f7e/4efb7b8afbcc48019c0c5fc9bdca666f/FLAGaa50a1cbc [2025-03-17 14:01:53,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d6a77f7e/4efb7b8afbcc48019c0c5fc9bdca666f [2025-03-17 14:01:53,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:01:53,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:01:53,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:01:53,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:01:53,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:01:53,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0db051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53, skipping insertion in model container [2025-03-17 14:01:53,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:01:53,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:01:53,599 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:01:53,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:01:53,655 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:01:53,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53 WrapperNode [2025-03-17 14:01:53,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:01:53,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:01:53,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:01:53,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:01:53,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,678 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-17 14:01:53,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:01:53,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:01:53,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:01:53,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:01:53,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,694 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-17 14:01:53,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:01:53,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:01:53,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:01:53,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:01:53,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (1/1) ... [2025-03-17 14:01:53,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:01:53,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:53,721 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-17 14:01:53,723 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-17 14:01:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-17 14:01:53,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-17 14:01:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 14:01:53,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 14:01:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:01:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:01:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:01:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:01:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:01:53,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:01:53,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:01:53,738 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:01:53,814 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:01:53,815 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:01:53,911 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:01:53,912 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:01:53,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:01:53,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:01:53,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:01:53 BoogieIcfgContainer [2025-03-17 14:01:53,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:01:53,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:01:53,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:01:53,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:01:53,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:01:53" (1/3) ... [2025-03-17 14:01:53,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2480ca73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:01:53, skipping insertion in model container [2025-03-17 14:01:53,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:53" (2/3) ... [2025-03-17 14:01:53,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2480ca73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:01:53, skipping insertion in model container [2025-03-17 14:01:53,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:01:53" (3/3) ... [2025-03-17 14:01:53,986 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-03-17 14:01:53,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:01:53,997 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-17 14:01:53,998 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:01:54,026 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:54,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 68 flow [2025-03-17 14:01:54,071 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-03-17 14:01:54,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:54,075 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 84 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-17 14:01:54,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 68 flow [2025-03-17 14:01:54,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 65 flow [2025-03-17 14:01:54,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:54,089 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;@7ae454f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:54,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 14:01:54,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:54,095 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-17 14:01:54,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:54,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:54,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:01:54,096 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-17 14:01:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 160475894, now seen corresponding path program 1 times [2025-03-17 14:01:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:54,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778688293] [2025-03-17 14:01:54,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:54,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:54,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:54,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:54,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:54,197 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-17 14:01:54,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:54,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778688293] [2025-03-17 14:01:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778688293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:54,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290654133] [2025-03-17 14:01:54,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:54,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:54,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:54,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:54,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-17 14:01:54,225 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-17 14:01:54,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:54,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-17 14:01:54,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:54,291 INFO L124 PetriNetUnfolderBase]: 79/165 cut-off events. [2025-03-17 14:01:54,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:54,292 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 699 event pairs, 66 based on Foata normal form. 29/190 useless extension candidates. Maximal degree in co-relation 304. Up to 136 conditions per place. [2025-03-17 14:01:54,296 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 12 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-03-17 14:01:54,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 73 flow [2025-03-17 14:01:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-03-17 14:01:54,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-17 14:01:54,308 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 65 flow. Second operand 2 states and 39 transitions. [2025-03-17 14:01:54,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 73 flow [2025-03-17 14:01:54,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:54,312 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 48 flow [2025-03-17 14:01:54,314 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-17 14:01:54,318 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -6 predicate places. [2025-03-17 14:01:54,318 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 48 flow [2025-03-17 14:01:54,318 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-17 14:01:54,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:54,319 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:54,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:01:54,319 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-17 14:01:54,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash 440688840, now seen corresponding path program 1 times [2025-03-17 14:01:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11642947] [2025-03-17 14:01:54,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:54,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:01:54,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:01:54,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:54,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:54,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:54,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:01:54,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:01:54,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:54,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:54,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:54,360 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:54,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-17 14:01:54,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-17 14:01:54,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-03-17 14:01:54,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-17 14:01:54,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-17 14:01:54,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:01:54,363 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 14:01:54,364 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:54,365 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 14:01:54,387 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:54,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 122 flow [2025-03-17 14:01:54,400 INFO L124 PetriNetUnfolderBase]: 5/45 cut-off events. [2025-03-17 14:01:54,401 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:01:54,401 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-17 14:01:54,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 51 transitions, 122 flow [2025-03-17 14:01:54,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 36 transitions, 85 flow [2025-03-17 14:01:54,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:54,403 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;@7ae454f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:54,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:01:54,405 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:54,405 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 14:01:54,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:54,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:54,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:01:54,405 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-17 14:01:54,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:54,405 INFO L85 PathProgramCache]: Analyzing trace with hash 209711478, now seen corresponding path program 1 times [2025-03-17 14:01:54,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:54,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046104996] [2025-03-17 14:01:54,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:54,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:54,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:54,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:54,434 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-17 14:01:54,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:54,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046104996] [2025-03-17 14:01:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046104996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:54,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:54,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:54,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521847321] [2025-03-17 14:01:54,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:54,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:54,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:54,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:54,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2025-03-17 14:01:54,440 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-17 14:01:54,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:54,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2025-03-17 14:01:54,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:54,586 INFO L124 PetriNetUnfolderBase]: 559/917 cut-off events. [2025-03-17 14:01:54,586 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-17 14:01:54,589 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 4595 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-17 14:01:54,595 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-03-17 14:01:54,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 99 flow [2025-03-17 14:01:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2025-03-17 14:01:54,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-03-17 14:01:54,597 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 85 flow. Second operand 2 states and 60 transitions. [2025-03-17 14:01:54,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 99 flow [2025-03-17 14:01:54,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:54,599 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 66 flow [2025-03-17 14:01:54,599 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-17 14:01:54,600 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2025-03-17 14:01:54,600 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 66 flow [2025-03-17 14:01:54,600 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-17 14:01:54,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:54,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:54,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:01:54,601 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-17 14:01:54,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash -558814368, now seen corresponding path program 1 times [2025-03-17 14:01:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309912171] [2025-03-17 14:01:54,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:54,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:01:54,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:01:54,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:54,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:54,698 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-17 14:01:54,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309912171] [2025-03-17 14:01:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309912171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:54,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:54,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306107494] [2025-03-17 14:01:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:54,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:54,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:54,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2025-03-17 14:01:54,705 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-17 14:01:54,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:54,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2025-03-17 14:01:54,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:54,803 INFO L124 PetriNetUnfolderBase]: 620/1065 cut-off events. [2025-03-17 14:01:54,803 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-17 14:01:54,808 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 5755 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-17 14:01:54,813 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 22 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-03-17 14:01:54,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 139 flow [2025-03-17 14:01:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-17 14:01:54,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5424836601307189 [2025-03-17 14:01:54,816 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 66 flow. Second operand 3 states and 83 transitions. [2025-03-17 14:01:54,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 139 flow [2025-03-17 14:01:54,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 139 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:54,818 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 85 flow [2025-03-17 14:01:54,819 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-17 14:01:54,819 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2025-03-17 14:01:54,819 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 85 flow [2025-03-17 14:01:54,819 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-17 14:01:54,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:54,819 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:54,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:01:54,820 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-17 14:01:54,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1915850340, now seen corresponding path program 1 times [2025-03-17 14:01:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:54,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367452733] [2025-03-17 14:01:54,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:54,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:54,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:54,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:54,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:54,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:54,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:54,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:54,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:54,851 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:54,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-17 14:01:54,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-17 14:01:54,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-17 14:01:54,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-17 14:01:54,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-17 14:01:54,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-17 14:01:54,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:01:54,852 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 14:01:54,852 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:54,852 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 14:01:54,872 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:54,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 72 transitions, 180 flow [2025-03-17 14:01:54,898 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-03-17 14:01:54,898 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:01:54,898 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 7. Compared 141 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-17 14:01:54,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 72 transitions, 180 flow [2025-03-17 14:01:54,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 43 transitions, 107 flow [2025-03-17 14:01:54,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:54,901 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;@7ae454f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:54,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:01:54,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:54,903 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-17 14:01:54,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:54,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:54,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:01:54,903 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-17 14:01:54,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 278987467, now seen corresponding path program 1 times [2025-03-17 14:01:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:54,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127480299] [2025-03-17 14:01:54,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:54,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:54,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:54,923 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-17 14:01:54,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:54,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127480299] [2025-03-17 14:01:54,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127480299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:54,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216309168] [2025-03-17 14:01:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:54,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:54,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:54,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:54,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 72 [2025-03-17 14:01:54,924 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-17 14:01:54,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:54,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 72 [2025-03-17 14:01:54,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:55,247 INFO L124 PetriNetUnfolderBase]: 3247/4709 cut-off events. [2025-03-17 14:01:55,247 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2025-03-17 14:01:55,256 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 25582 event pairs, 2562 based on Foata normal form. 509/5155 useless extension candidates. Maximal degree in co-relation 9240. Up to 4224 conditions per place. [2025-03-17 14:01:55,273 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 20 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2025-03-17 14:01:55,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 127 flow [2025-03-17 14:01:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2025-03-17 14:01:55,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-17 14:01:55,275 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 107 flow. Second operand 2 states and 81 transitions. [2025-03-17 14:01:55,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 127 flow [2025-03-17 14:01:55,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 124 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:55,278 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 84 flow [2025-03-17 14:01:55,278 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-17 14:01:55,278 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2025-03-17 14:01:55,279 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 84 flow [2025-03-17 14:01:55,279 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-17 14:01:55,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:55,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:55,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:01:55,279 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-17 14:01:55,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1835444083, now seen corresponding path program 1 times [2025-03-17 14:01:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075184329] [2025-03-17 14:01:55,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:55,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:01:55,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:01:55,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:55,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:55,336 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-17 14:01:55,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075184329] [2025-03-17 14:01:55,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075184329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:55,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:55,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642858535] [2025-03-17 14:01:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:55,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:55,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:55,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 72 [2025-03-17 14:01:55,344 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-17 14:01:55,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:55,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 72 [2025-03-17 14:01:55,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:55,687 INFO L124 PetriNetUnfolderBase]: 3515/5256 cut-off events. [2025-03-17 14:01:55,687 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2025-03-17 14:01:55,696 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 30638 event pairs, 724 based on Foata normal form. 44/5277 useless extension candidates. Maximal degree in co-relation 10156. Up to 4267 conditions per place. [2025-03-17 14:01:55,718 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 28 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-17 14:01:55,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2025-03-17 14:01:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-03-17 14:01:55,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-03-17 14:01:55,720 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 84 flow. Second operand 3 states and 114 transitions. [2025-03-17 14:01:55,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2025-03-17 14:01:55,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:55,721 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 110 flow [2025-03-17 14:01:55,721 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-17 14:01:55,722 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2025-03-17 14:01:55,722 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 110 flow [2025-03-17 14:01:55,722 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-17 14:01:55,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:55,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:55,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:01:55,722 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-17 14:01:55,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1423324151, now seen corresponding path program 1 times [2025-03-17 14:01:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922318494] [2025-03-17 14:01:55,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:55,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:55,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:01:55,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:01:55,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:55,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:55,784 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-17 14:01:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922318494] [2025-03-17 14:01:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922318494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839616401] [2025-03-17 14:01:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:55,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:55,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 72 [2025-03-17 14:01:55,786 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-17 14:01:55,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:55,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 72 [2025-03-17 14:01:55,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:55,889 INFO L124 PetriNetUnfolderBase]: 456/1058 cut-off events. [2025-03-17 14:01:55,889 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-03-17 14:01:55,891 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 68. Compared 6200 event pairs, 102 based on Foata normal form. 618/1658 useless extension candidates. Maximal degree in co-relation 2274. Up to 633 conditions per place. [2025-03-17 14:01:55,894 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 21 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2025-03-17 14:01:55,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 193 flow [2025-03-17 14:01:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-17 14:01:55,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-03-17 14:01:55,897 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 110 flow. Second operand 3 states and 111 transitions. [2025-03-17 14:01:55,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 193 flow [2025-03-17 14:01:55,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:55,899 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 122 flow [2025-03-17 14:01:55,900 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-17 14:01:55,900 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-03-17 14:01:55,900 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 122 flow [2025-03-17 14:01:55,900 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-17 14:01:55,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:55,900 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:55,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:01:55,900 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-17 14:01:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1692304621, now seen corresponding path program 1 times [2025-03-17 14:01:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298944534] [2025-03-17 14:01:55,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:55,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:01:55,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:01:55,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:55,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:55,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:55,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:01:55,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:01:55,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:55,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:55,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:55,927 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:55,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-17 14:01:55,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:01:55,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-17 14:01:55,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 14:01:55,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-17 14:01:55,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-17 14:01:55,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:01:55,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:01:55,928 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 14:01:55,928 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:55,928 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 14:01:55,957 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:55,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 93 transitions, 242 flow [2025-03-17 14:01:55,965 INFO L124 PetriNetUnfolderBase]: 7/69 cut-off events. [2025-03-17 14:01:55,965 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 14:01:55,965 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 173 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-17 14:01:55,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 93 transitions, 242 flow [2025-03-17 14:01:55,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 50 transitions, 131 flow [2025-03-17 14:01:55,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:55,968 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;@7ae454f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:55,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 14:01:55,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:55,969 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 14:01:55,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:55,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:55,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:01:55,969 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-17 14:01:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:55,970 INFO L85 PathProgramCache]: Analyzing trace with hash 368303861, now seen corresponding path program 1 times [2025-03-17 14:01:55,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:55,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313136378] [2025-03-17 14:01:55,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:55,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:55,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:55,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:55,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:55,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:55,981 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-17 14:01:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313136378] [2025-03-17 14:01:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313136378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058947858] [2025-03-17 14:01:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:55,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:55,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:55,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:55,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:55,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-03-17 14:01:55,983 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-17 14:01:55,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:55,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-03-17 14:01:55,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:57,261 INFO L124 PetriNetUnfolderBase]: 17071/22949 cut-off events. [2025-03-17 14:01:57,261 INFO L125 PetriNetUnfolderBase]: For 4208/4208 co-relation queries the response was YES. [2025-03-17 14:01:57,310 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 131487 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-17 14:01:57,408 INFO L140 encePairwiseOnDemand]: 85/93 looper letters, 24 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-03-17 14:01:57,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 157 flow [2025-03-17 14:01:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:01:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:01:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2025-03-17 14:01:57,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-03-17 14:01:57,409 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 131 flow. Second operand 2 states and 102 transitions. [2025-03-17 14:01:57,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 157 flow [2025-03-17 14:01:57,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 150 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:57,413 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 102 flow [2025-03-17 14:01:57,413 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-17 14:01:57,414 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -9 predicate places. [2025-03-17 14:01:57,414 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 102 flow [2025-03-17 14:01:57,414 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-17 14:01:57,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:57,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:57,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:01:57,414 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-17 14:01:57,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:57,415 INFO L85 PathProgramCache]: Analyzing trace with hash 342592230, now seen corresponding path program 1 times [2025-03-17 14:01:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:57,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253316860] [2025-03-17 14:01:57,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:57,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:57,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:01:57,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:01:57,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:57,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:57,454 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-17 14:01:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:57,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253316860] [2025-03-17 14:01:57,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253316860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:57,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240690170] [2025-03-17 14:01:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:57,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:57,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:57,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:57,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-03-17 14:01:57,463 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-17 14:01:57,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:57,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-03-17 14:01:57,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:58,559 INFO L124 PetriNetUnfolderBase]: 17930/24627 cut-off events. [2025-03-17 14:01:58,559 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2025-03-17 14:01:58,596 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 149030 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-17 14:01:58,668 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 34 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-17 14:01:58,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 225 flow [2025-03-17 14:01:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-03-17 14:01:58,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5197132616487455 [2025-03-17 14:01:58,670 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 102 flow. Second operand 3 states and 145 transitions. [2025-03-17 14:01:58,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 225 flow [2025-03-17 14:01:58,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:58,672 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 135 flow [2025-03-17 14:01:58,672 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-17 14:01:58,673 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -6 predicate places. [2025-03-17 14:01:58,673 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 135 flow [2025-03-17 14:01:58,673 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-17 14:01:58,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:58,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:58,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:01:58,674 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-17 14:01:58,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:58,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1259711650, now seen corresponding path program 1 times [2025-03-17 14:01:58,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:58,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044945622] [2025-03-17 14:01:58,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:58,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:01:58,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:01:58,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:58,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:58,711 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-17 14:01:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:58,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044945622] [2025-03-17 14:01:58,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044945622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:58,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:58,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023072327] [2025-03-17 14:01:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:58,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:58,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:58,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:58,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-03-17 14:01:58,716 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-17 14:01:58,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:58,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-03-17 14:01:58,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:58,843 INFO L124 PetriNetUnfolderBase]: 1187/2606 cut-off events. [2025-03-17 14:01:58,843 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-03-17 14:01:58,850 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 17745 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-17 14:01:58,857 INFO L140 encePairwiseOnDemand]: 83/93 looper letters, 25 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2025-03-17 14:01:58,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 237 flow [2025-03-17 14:01:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-03-17 14:01:58,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2025-03-17 14:01:58,859 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 135 flow. Second operand 3 states and 141 transitions. [2025-03-17 14:01:58,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 237 flow [2025-03-17 14:01:58,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:58,861 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 150 flow [2025-03-17 14:01:58,861 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-17 14:01:58,861 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2025-03-17 14:01:58,862 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 150 flow [2025-03-17 14:01:58,862 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-17 14:01:58,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:58,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:58,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:01:58,862 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-17 14:01:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1627971358, now seen corresponding path program 1 times [2025-03-17 14:01:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399938572] [2025-03-17 14:01:58,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:58,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:01:58,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:01:58,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:58,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:58,977 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-17 14:01:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:58,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399938572] [2025-03-17 14:01:58,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399938572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:58,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990934354] [2025-03-17 14:01:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:58,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:01:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:58,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:01:58,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:01:58,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-03-17 14:01:58,990 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-17 14:01:58,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:58,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-03-17 14:01:58,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:59,249 INFO L124 PetriNetUnfolderBase]: 1731/3693 cut-off events. [2025-03-17 14:01:59,249 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2025-03-17 14:01:59,258 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 26828 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-17 14:01:59,269 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 49 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2025-03-17 14:01:59,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 396 flow [2025-03-17 14:01:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:01:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:01:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-17 14:01:59,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5349462365591398 [2025-03-17 14:01:59,271 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 150 flow. Second operand 4 states and 199 transitions. [2025-03-17 14:01:59,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 396 flow [2025-03-17 14:01:59,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:59,275 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 192 flow [2025-03-17 14:01:59,275 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-17 14:01:59,275 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2025-03-17 14:01:59,275 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 192 flow [2025-03-17 14:01:59,276 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-17 14:01:59,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:59,276 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:59,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:01:59,276 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-17 14:01:59,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1999518742, now seen corresponding path program 1 times [2025-03-17 14:01:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:59,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59013237] [2025-03-17 14:01:59,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:59,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:01:59,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:01:59,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:59,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:59,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:59,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:01:59,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:01:59,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:59,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:59,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:59,293 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:59,294 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-17 14:01:59,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-17 14:01:59,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-03-17 14:01:59,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-03-17 14:01:59,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-17 14:01:59,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-03-17 14:01:59,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-03-17 14:01:59,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-17 14:01:59,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:01:59,296 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 14:01:59,296 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:59,297 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 14:01:59,331 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:59,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 114 transitions, 308 flow [2025-03-17 14:01:59,338 INFO L124 PetriNetUnfolderBase]: 8/81 cut-off events. [2025-03-17 14:01:59,338 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 14:01:59,339 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 211 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-17 14:01:59,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 114 transitions, 308 flow [2025-03-17 14:01:59,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 57 transitions, 157 flow [2025-03-17 14:01:59,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:59,341 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;@7ae454f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:59,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 14:01:59,342 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:59,343 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-17 14:01:59,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:59,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:59,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:01:59,343 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-17 14:01:59,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash 477660660, now seen corresponding path program 1 times [2025-03-17 14:01:59,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:59,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614988577] [2025-03-17 14:01:59,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:59,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:59,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:59,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:59,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:59,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:59,356 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-17 14:01:59,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:59,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614988577] [2025-03-17 14:01:59,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614988577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:59,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:01:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003617846] [2025-03-17 14:01:59,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:59,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:01:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:59,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:01:59,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:01:59,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-03-17 14:01:59,359 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-17 14:01:59,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:59,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-03-17 14:01:59,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:02:04,609 INFO L124 PetriNetUnfolderBase]: 84655/108197 cut-off events. [2025-03-17 14:02:04,609 INFO L125 PetriNetUnfolderBase]: For 26992/26992 co-relation queries the response was YES. [2025-03-17 14:02:04,870 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 634320 event pairs, 65538 based on Foata normal form. 8189/115362 useless extension candidates. Maximal degree in co-relation 216280. Up to 100352 conditions per place. [2025-03-17 14:02:05,418 INFO L140 encePairwiseOnDemand]: 105/114 looper letters, 28 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2025-03-17 14:02:05,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 189 flow [2025-03-17 14:02:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:02:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 14:02:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 123 transitions. [2025-03-17 14:02:05,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-03-17 14:02:05,419 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 157 flow. Second operand 2 states and 123 transitions. [2025-03-17 14:02:05,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 189 flow [2025-03-17 14:02:05,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 176 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:02:05,429 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 120 flow [2025-03-17 14:02:05,429 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-17 14:02:05,429 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2025-03-17 14:02:05,429 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 120 flow [2025-03-17 14:02:05,429 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-17 14:02:05,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:02:05,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:02:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:02:05,430 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-17 14:02:05,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:02:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1896157415, now seen corresponding path program 1 times [2025-03-17 14:02:05,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:02:05,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24207415] [2025-03-17 14:02:05,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:02:05,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:02:05,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:02:05,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:02:05,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:02:05,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:02:05,459 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-17 14:02:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:02:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24207415] [2025-03-17 14:02:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24207415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:02:05,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:02:05,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:02:05,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955870252] [2025-03-17 14:02:05,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:02:05,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:02:05,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:02:05,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:02:05,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:02:05,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-03-17 14:02:05,469 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-17 14:02:05,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:02:05,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-03-17 14:02:05,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:02:10,869 INFO L124 PetriNetUnfolderBase]: 87029/112962 cut-off events. [2025-03-17 14:02:10,869 INFO L125 PetriNetUnfolderBase]: For 5082/5082 co-relation queries the response was YES. [2025-03-17 14:02:11,184 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 694036 event pairs, 21478 based on Foata normal form. 188/112988 useless extension candidates. Maximal degree in co-relation 221176. Up to 101893 conditions per place. [2025-03-17 14:02:11,567 INFO L140 encePairwiseOnDemand]: 107/114 looper letters, 40 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-03-17 14:02:11,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 268 flow [2025-03-17 14:02:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:02:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:02:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-17 14:02:11,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5146198830409356 [2025-03-17 14:02:11,569 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 120 flow. Second operand 3 states and 176 transitions. [2025-03-17 14:02:11,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 268 flow [2025-03-17 14:02:11,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:02:11,576 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 160 flow [2025-03-17 14:02:11,576 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-17 14:02:11,577 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-03-17 14:02:11,577 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 160 flow [2025-03-17 14:02:11,577 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-17 14:02:11,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:02:11,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:02:11,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:02:11,577 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-17 14:02:11,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:02:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash -802769505, now seen corresponding path program 1 times [2025-03-17 14:02:11,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:02:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491102568] [2025-03-17 14:02:11,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:02:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:02:11,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:02:11,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:02:11,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:02:11,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:02:11,608 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-17 14:02:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:02:11,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491102568] [2025-03-17 14:02:11,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491102568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:02:11,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:02:11,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:02:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963970143] [2025-03-17 14:02:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:02:11,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:02:11,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:02:11,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:02:11,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:02:11,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-03-17 14:02:11,610 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-17 14:02:11,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:02:11,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-03-17 14:02:11,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:02:12,023 INFO L124 PetriNetUnfolderBase]: 2900/6134 cut-off events. [2025-03-17 14:02:12,023 INFO L125 PetriNetUnfolderBase]: For 1688/1688 co-relation queries the response was YES. [2025-03-17 14:02:12,042 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 47516 event pairs, 648 based on Foata normal form. 6162/12225 useless extension candidates. Maximal degree in co-relation 13488. Up to 3945 conditions per place. [2025-03-17 14:02:12,057 INFO L140 encePairwiseOnDemand]: 102/114 looper letters, 29 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2025-03-17 14:02:12,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 281 flow [2025-03-17 14:02:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:02:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:02:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2025-03-17 14:02:12,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 14:02:12,058 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 160 flow. Second operand 3 states and 171 transitions. [2025-03-17 14:02:12,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 281 flow [2025-03-17 14:02:12,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:02:12,061 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 178 flow [2025-03-17 14:02:12,061 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-17 14:02:12,062 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2025-03-17 14:02:12,062 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 178 flow [2025-03-17 14:02:12,062 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-17 14:02:12,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:02:12,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:02:12,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:02:12,063 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-17 14:02:12,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:02:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1988039295, now seen corresponding path program 1 times [2025-03-17 14:02:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:02:12,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924626441] [2025-03-17 14:02:12,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:02:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:02:12,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:02:12,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:02:12,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:02:12,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:02:12,123 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-17 14:02:12,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:02:12,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924626441] [2025-03-17 14:02:12,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924626441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:02:12,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:02:12,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:02:12,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446438738] [2025-03-17 14:02:12,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:02:12,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:02:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:02:12,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:02:12,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:02:12,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-03-17 14:02:12,135 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-17 14:02:12,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:02:12,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-03-17 14:02:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:02:12,517 INFO L124 PetriNetUnfolderBase]: 4045/8234 cut-off events. [2025-03-17 14:02:12,517 INFO L125 PetriNetUnfolderBase]: For 2462/2462 co-relation queries the response was YES. [2025-03-17 14:02:12,539 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 433. Compared 65328 event pairs, 162 based on Foata normal form. 45/8268 useless extension candidates. Maximal degree in co-relation 21120. Up to 5638 conditions per place. [2025-03-17 14:02:12,563 INFO L140 encePairwiseOnDemand]: 107/114 looper letters, 58 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2025-03-17 14:02:12,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 476 flow [2025-03-17 14:02:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:02:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:02:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2025-03-17 14:02:12,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5307017543859649 [2025-03-17 14:02:12,564 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 178 flow. Second operand 4 states and 242 transitions. [2025-03-17 14:02:12,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 476 flow [2025-03-17 14:02:12,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:02:12,572 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 230 flow [2025-03-17 14:02:12,572 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-17 14:02:12,573 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2025-03-17 14:02:12,573 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 230 flow [2025-03-17 14:02:12,573 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-17 14:02:12,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:02:12,573 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:02:12,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:02:12,573 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-17 14:02:12,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:02:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash 640358576, now seen corresponding path program 1 times [2025-03-17 14:02:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:02:12,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349840782] [2025-03-17 14:02:12,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:02:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:02:12,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:02:12,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:02:12,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:02:12,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:02:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:02:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:02:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349840782] [2025-03-17 14:02:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349840782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:02:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919191915] [2025-03-17 14:02:12,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:02:12,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:02:12,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:02:12,629 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-17 14:02:12,630 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-17 14:02:12,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:02:12,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:02:12,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:02:12,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:02:12,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:02:12,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:02:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:02:12,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:02:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:02:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919191915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:02:12,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:02:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 14:02:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896646689] [2025-03-17 14:02:12,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:02:12,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:02:12,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:02:12,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:02:12,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:02:12,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 114 [2025-03-17 14:02:12,885 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-17 14:02:12,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:02:12,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 114 [2025-03-17 14:02:12,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:02:14,125 INFO L124 PetriNetUnfolderBase]: 10827/20156 cut-off events. [2025-03-17 14:02:14,126 INFO L125 PetriNetUnfolderBase]: For 9660/9664 co-relation queries the response was YES. [2025-03-17 14:02:14,180 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 167032 event pairs, 2132 based on Foata normal form. 513/20658 useless extension candidates. Maximal degree in co-relation 50423. Up to 6688 conditions per place. [2025-03-17 14:02:14,250 INFO L140 encePairwiseOnDemand]: 107/114 looper letters, 60 selfloop transitions, 26 changer transitions 0/100 dead transitions. [2025-03-17 14:02:14,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 592 flow [2025-03-17 14:02:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:02:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:02:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-03-17 14:02:14,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47192982456140353 [2025-03-17 14:02:14,252 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 230 flow. Second operand 5 states and 269 transitions. [2025-03-17 14:02:14,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 592 flow [2025-03-17 14:02:14,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 570 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-17 14:02:14,261 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 310 flow [2025-03-17 14:02:14,261 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-17 14:02:14,262 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2025-03-17 14:02:14,262 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 310 flow [2025-03-17 14:02:14,262 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-17 14:02:14,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:02:14,263 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:02:14,270 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-17 14:02:14,467 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-17 14:02:14,467 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-17 14:02:14,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:02:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash 636772178, now seen corresponding path program 1 times [2025-03-17 14:02:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:02:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072929815] [2025-03-17 14:02:14,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:02:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:02:14,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:02:14,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:02:14,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:02:14,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:02:14,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:02:14,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:02:14,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:02:14,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:02:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:02:14,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:02:14,483 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-03-17 14:02:14,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-03-17 14:02:14,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:02:14,484 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 14:02:14,484 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:02:14,484 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-17 14:02:14,506 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:02:14,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 378 flow [2025-03-17 14:02:14,511 INFO L124 PetriNetUnfolderBase]: 9/93 cut-off events. [2025-03-17 14:02:14,511 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 14:02:14,512 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-17 14:02:14,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 135 transitions, 378 flow [2025-03-17 14:02:14,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 64 transitions, 185 flow [2025-03-17 14:02:14,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:02:14,513 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;@7ae454f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:02:14,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 14:02:14,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:02:14,513 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-17 14:02:14,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:02:14,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:02:14,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:02:14,514 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-17 14:02:14,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:02:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash 607057864, now seen corresponding path program 1 times [2025-03-17 14:02:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:02:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276185222] [2025-03-17 14:02:14,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:02:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:02:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:02:14,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:02:14,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:02:14,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:02:14,521 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-17 14:02:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:02:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276185222] [2025-03-17 14:02:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276185222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:02:14,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:02:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:02:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15587299] [2025-03-17 14:02:14,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:02:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:02:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:02:14,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:02:14,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:02:14,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 135 [2025-03-17 14:02:14,522 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-17 14:02:14,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:02:14,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 135 [2025-03-17 14:02:14,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand