./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/01b_inc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/01b_inc.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 f8560a665e9f795d0e42a91570dfb6029ba2a9fa9f17754a8891b62ccadb5cdc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:44:16,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:44:16,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:44:16,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:44:16,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:44:16,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:44:16,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:44:16,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:44:16,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:44:16,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:44:16,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:44:16,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:44:16,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:44:16,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:44:16,275 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:44:16,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:44:16,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:44:16,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:44:16,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:44:16,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:44:16,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:16,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:44:16,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:44:16,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:44:16,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:44:16,277 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 -> f8560a665e9f795d0e42a91570dfb6029ba2a9fa9f17754a8891b62ccadb5cdc [2025-03-04 09:44:16,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:44:16,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:44:16,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:44:16,499 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:44:16,499 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:44:16,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/01b_inc.i [2025-03-04 09:44:17,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b052bf2f/bda2c06b145a4061ad02a4a4d6629669/FLAG5c6fe72de [2025-03-04 09:44:17,924 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:44:17,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/01b_inc.i [2025-03-04 09:44:17,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b052bf2f/bda2c06b145a4061ad02a4a4d6629669/FLAG5c6fe72de [2025-03-04 09:44:18,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b052bf2f/bda2c06b145a4061ad02a4a4d6629669 [2025-03-04 09:44:18,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:44:18,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:44:18,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:18,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:44:18,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:44:18,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdd72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18, skipping insertion in model container [2025-03-04 09:44:18,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:44:18,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:18,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:44:18,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:18,484 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:44:18,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18 WrapperNode [2025-03-04 09:44:18,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:18,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:18,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:44:18,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:44:18,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,509 INFO L138 Inliner]: procedures = 163, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-03-04 09:44:18,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:18,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:44:18,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:44:18,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:44:18,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,523 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-04 09:44:18,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:44:18,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:44:18,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:44:18,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:44:18,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (1/1) ... [2025-03-04 09:44:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:18,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:18,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:44:18,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 09:44:18,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:44:18,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:44:18,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:44:18,575 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:44:18,669 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:44:18,671 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:44:18,783 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:44:18,783 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:44:18,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:44:18,863 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:44:18,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:18 BoogieIcfgContainer [2025-03-04 09:44:18,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:44:18,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:44:18,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:44:18,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:44:18,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:44:18" (1/3) ... [2025-03-04 09:44:18,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b394880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:18, skipping insertion in model container [2025-03-04 09:44:18,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:18" (2/3) ... [2025-03-04 09:44:18,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b394880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:18, skipping insertion in model container [2025-03-04 09:44:18,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:18" (3/3) ... [2025-03-04 09:44:18,875 INFO L128 eAbstractionObserver]: Analyzing ICFG 01b_inc.i [2025-03-04 09:44:18,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:44:18,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 01b_inc.i that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-04 09:44:18,888 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:44:18,932 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:18,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 48 flow [2025-03-04 09:44:18,979 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-03-04 09:44:18,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:18,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-04 09:44:18,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 22 transitions, 48 flow [2025-03-04 09:44:18,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 22 transitions, 48 flow [2025-03-04 09:44:18,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:19,006 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;@79104ab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:19,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 09:44:19,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:19,012 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:19,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:19,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:19,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:19,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:19,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash 140265, now seen corresponding path program 1 times [2025-03-04 09:44:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:19,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31137864] [2025-03-04 09:44:19,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:19,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:19,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:19,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:19,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31137864] [2025-03-04 09:44:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31137864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:19,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567234557] [2025-03-04 09:44:19,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:19,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:19,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:19,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:19,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:19,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 22 [2025-03-04 09:44:19,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 48 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:19,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:19,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 22 [2025-03-04 09:44:19,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:19,213 INFO L124 PetriNetUnfolderBase]: 21/67 cut-off events. [2025-03-04 09:44:19,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:19,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 67 events. 21/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 172 event pairs, 18 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 109. Up to 51 conditions per place. [2025-03-04 09:44:19,219 INFO L140 encePairwiseOnDemand]: 21/22 looper letters, 13 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2025-03-04 09:44:19,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 19 transitions, 68 flow [2025-03-04 09:44:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2025-03-04 09:44:19,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-04 09:44:19,231 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 48 flow. Second operand 2 states and 28 transitions. [2025-03-04 09:44:19,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 19 transitions, 68 flow [2025-03-04 09:44:19,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 19 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:19,236 INFO L231 Difference]: Finished difference. Result has 22 places, 19 transitions, 42 flow [2025-03-04 09:44:19,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=22, PETRI_TRANSITIONS=19} [2025-03-04 09:44:19,241 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, -2 predicate places. [2025-03-04 09:44:19,241 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 42 flow [2025-03-04 09:44:19,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:19,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:19,242 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 09:44:19,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:44:19,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:19,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash -114332819, now seen corresponding path program 1 times [2025-03-04 09:44:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:19,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210760876] [2025-03-04 09:44:19,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:19,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:19,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:19,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:19,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:19,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:44:19,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:44:19,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:19,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:19,309 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:19,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 09:44:19,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 09:44:19,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-03-04 09:44:19,312 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-03-04 09:44:19,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:44:19,312 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 09:44:19,315 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:19,316 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 09:44:19,339 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:19,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 84 flow [2025-03-04 09:44:19,353 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2025-03-04 09:44:19,353 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:44:19,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 46 events. 2/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2025-03-04 09:44:19,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 37 transitions, 84 flow [2025-03-04 09:44:19,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 84 flow [2025-03-04 09:44:19,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:19,357 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;@79104ab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:19,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 09:44:19,358 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:19,360 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:19,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:19,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:19,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:19,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:44:19,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 177006, now seen corresponding path program 1 times [2025-03-04 09:44:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:19,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-03-04 09:44:19,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:19,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:19,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:19,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-03-04 09:44:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820046324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:19,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498650622] [2025-03-04 09:44:19,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:19,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:19,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:19,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:19,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-04 09:44:19,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:19,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:19,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-04 09:44:19,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:19,554 INFO L124 PetriNetUnfolderBase]: 516/985 cut-off events. [2025-03-04 09:44:19,555 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 09:44:19,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 985 events. 516/985 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5276 event pairs, 468 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 791. Up to 801 conditions per place. [2025-03-04 09:44:19,561 INFO L140 encePairwiseOnDemand]: 36/37 looper letters, 23 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2025-03-04 09:44:19,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 124 flow [2025-03-04 09:44:19,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2025-03-04 09:44:19,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-03-04 09:44:19,562 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 84 flow. Second operand 2 states and 48 transitions. [2025-03-04 09:44:19,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 124 flow [2025-03-04 09:44:19,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:19,563 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 78 flow [2025-03-04 09:44:19,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-04 09:44:19,564 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-03-04 09:44:19,564 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 78 flow [2025-03-04 09:44:19,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:19,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:19,565 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-04 09:44:19,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:44:19,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:44:19,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:19,565 INFO L85 PathProgramCache]: Analyzing trace with hash 836424505, now seen corresponding path program 1 times [2025-03-04 09:44:19,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745351598] [2025-03-04 09:44:19,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:19,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:19,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:19,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:19,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:19,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:44:19,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:44:19,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:19,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:19,597 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:19,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 09:44:19,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-04 09:44:19,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-03-04 09:44:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-03-04 09:44:19,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-04 09:44:19,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:44:19,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 09:44:19,602 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:19,602 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 09:44:19,627 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:19,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 122 flow [2025-03-04 09:44:19,633 INFO L124 PetriNetUnfolderBase]: 3/66 cut-off events. [2025-03-04 09:44:19,634 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:44:19,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 66 events. 3/66 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 195 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 53. Up to 4 conditions per place. [2025-03-04 09:44:19,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 52 transitions, 122 flow [2025-03-04 09:44:19,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 52 transitions, 122 flow [2025-03-04 09:44:19,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:19,636 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;@79104ab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:19,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 09:44:19,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:19,637 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:19,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:19,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:19,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:19,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:44:19,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash 228642, now seen corresponding path program 1 times [2025-03-04 09:44:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642008966] [2025-03-04 09:44:19,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:19,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:19,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:19,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:19,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:19,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642008966] [2025-03-04 09:44:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642008966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068096705] [2025-03-04 09:44:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:19,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:19,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:19,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-04 09:44:19,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:19,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:19,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-04 09:44:19,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:20,528 INFO L124 PetriNetUnfolderBase]: 8181/12905 cut-off events. [2025-03-04 09:44:20,529 INFO L125 PetriNetUnfolderBase]: For 703/703 co-relation queries the response was YES. [2025-03-04 09:44:20,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24342 conditions, 12905 events. 8181/12905 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 89653 event pairs, 7668 based on Foata normal form. 0/11769 useless extension candidates. Maximal degree in co-relation 4070. Up to 11001 conditions per place. [2025-03-04 09:44:20,631 INFO L140 encePairwiseOnDemand]: 51/52 looper letters, 33 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2025-03-04 09:44:20,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 182 flow [2025-03-04 09:44:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2025-03-04 09:44:20,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2025-03-04 09:44:20,634 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 122 flow. Second operand 2 states and 68 transitions. [2025-03-04 09:44:20,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 182 flow [2025-03-04 09:44:20,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:20,636 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 114 flow [2025-03-04 09:44:20,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-03-04 09:44:20,638 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-03-04 09:44:20,638 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 114 flow [2025-03-04 09:44:20,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:20,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:20,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:20,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:44:20,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:44:20,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1074686339, now seen corresponding path program 1 times [2025-03-04 09:44:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645136654] [2025-03-04 09:44:20,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:20,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:20,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:20,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:20,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:20,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645136654] [2025-03-04 09:44:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645136654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:20,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:20,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658374046] [2025-03-04 09:44:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:20,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:20,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:20,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:20,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2025-03-04 09:44:20,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:20,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:20,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2025-03-04 09:44:20,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:21,991 INFO L124 PetriNetUnfolderBase]: 11367/19206 cut-off events. [2025-03-04 09:44:21,992 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-03-04 09:44:22,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35839 conditions, 19206 events. 11367/19206 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 156461 event pairs, 3321 based on Foata normal form. 0/16619 useless extension candidates. Maximal degree in co-relation 35833. Up to 7422 conditions per place. [2025-03-04 09:44:22,074 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 104 selfloop transitions, 12 changer transitions 0/129 dead transitions. [2025-03-04 09:44:22,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 129 transitions, 536 flow [2025-03-04 09:44:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2025-03-04 09:44:22,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2025-03-04 09:44:22,078 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 114 flow. Second operand 6 states and 206 transitions. [2025-03-04 09:44:22,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 129 transitions, 536 flow [2025-03-04 09:44:22,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 129 transitions, 536 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:22,081 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 205 flow [2025-03-04 09:44:22,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-03-04 09:44:22,083 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2025-03-04 09:44:22,084 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 205 flow [2025-03-04 09:44:22,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:22,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:22,084 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-04 09:44:22,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:44:22,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:44:22,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1474456340, now seen corresponding path program 1 times [2025-03-04 09:44:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-03-04 09:44:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:22,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:44:22,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:44:22,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:22,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:22,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:22,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:44:22,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:44:22,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:22,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:22,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:22,115 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:22,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 09:44:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-04 09:44:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-04 09:44:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-03-04 09:44:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-04 09:44:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-04 09:44:22,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:44:22,115 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 09:44:22,116 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 09:44:22,116 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 09:44:22,142 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:22,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 162 flow [2025-03-04 09:44:22,151 INFO L124 PetriNetUnfolderBase]: 4/86 cut-off events. [2025-03-04 09:44:22,152 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 09:44:22,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 86 events. 4/86 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 276 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2025-03-04 09:44:22,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 67 transitions, 162 flow [2025-03-04 09:44:22,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 67 transitions, 162 flow [2025-03-04 09:44:22,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:22,156 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;@79104ab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:22,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:44:22,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:22,157 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-04 09:44:22,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:22,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:22,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 09:44:22,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:44:22,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash 295173, now seen corresponding path program 1 times [2025-03-04 09:44:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424629805] [2025-03-04 09:44:22,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:22,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:44:22,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:44:22,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:22,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:22,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424629805] [2025-03-04 09:44:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424629805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:44:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539910099] [2025-03-04 09:44:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:22,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 09:44:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:22,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 09:44:22,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 09:44:22,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2025-03-04 09:44:22,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 162 flow. Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:22,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:22,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2025-03-04 09:44:22,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:29,020 INFO L124 PetriNetUnfolderBase]: 111831/159125 cut-off events. [2025-03-04 09:44:29,021 INFO L125 PetriNetUnfolderBase]: For 12291/12291 co-relation queries the response was YES. [2025-03-04 09:44:29,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304563 conditions, 159125 events. 111831/159125 cut-off events. For 12291/12291 co-relation queries the response was YES. Maximal size of possible extension queue 6025. Compared 1260773 event pairs, 106668 based on Foata normal form. 0/144419 useless extension candidates. Maximal degree in co-relation 24448. Up to 140001 conditions per place. [2025-03-04 09:44:29,972 INFO L140 encePairwiseOnDemand]: 66/67 looper letters, 43 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2025-03-04 09:44:29,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 242 flow [2025-03-04 09:44:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 09:44:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 09:44:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 88 transitions. [2025-03-04 09:44:29,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6567164179104478 [2025-03-04 09:44:29,973 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 162 flow. Second operand 2 states and 88 transitions. [2025-03-04 09:44:29,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 242 flow [2025-03-04 09:44:29,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 236 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:29,984 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 150 flow [2025-03-04 09:44:29,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=150, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2025-03-04 09:44:29,987 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-03-04 09:44:29,987 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 150 flow [2025-03-04 09:44:29,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:29,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:29,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:29,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:44:29,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:44:29,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash 984933620, now seen corresponding path program 1 times [2025-03-04 09:44:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135840197] [2025-03-04 09:44:29,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:29,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:29,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:44:29,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:44:29,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:29,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:30,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:30,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135840197] [2025-03-04 09:44:30,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135840197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:30,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:30,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:30,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262536983] [2025-03-04 09:44:30,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:30,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:30,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:30,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:30,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:30,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-03-04 09:44:30,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:30,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:30,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-03-04 09:44:30,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:43,203 INFO L124 PetriNetUnfolderBase]: 207509/303575 cut-off events. [2025-03-04 09:44:43,204 INFO L125 PetriNetUnfolderBase]: For 5181/5181 co-relation queries the response was YES. [2025-03-04 09:44:44,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576711 conditions, 303575 events. 207509/303575 cut-off events. For 5181/5181 co-relation queries the response was YES. Maximal size of possible extension queue 12240. Compared 2715768 event pairs, 70926 based on Foata normal form. 0/257763 useless extension candidates. Maximal degree in co-relation 576704. Up to 133343 conditions per place. [2025-03-04 09:44:45,438 INFO L140 encePairwiseOnDemand]: 55/67 looper letters, 144 selfloop transitions, 15 changer transitions 0/176 dead transitions. [2025-03-04 09:44:45,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 176 transitions, 742 flow [2025-03-04 09:44:45,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:44:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:44:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2025-03-04 09:44:45,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6840796019900498 [2025-03-04 09:44:45,441 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 150 flow. Second operand 6 states and 275 transitions. [2025-03-04 09:44:45,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 176 transitions, 742 flow [2025-03-04 09:44:45,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 176 transitions, 742 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 09:44:45,449 INFO L231 Difference]: Finished difference. Result has 79 places, 80 transitions, 268 flow [2025-03-04 09:44:45,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2025-03-04 09:44:45,449 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2025-03-04 09:44:45,449 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 268 flow [2025-03-04 09:44:45,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:45,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:45,450 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:45,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:44:45,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 09:44:45,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1789007669, now seen corresponding path program 1 times [2025-03-04 09:44:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87861491] [2025-03-04 09:44:45,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:45,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:45,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:44:45,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:44:45,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87861491] [2025-03-04 09:44:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87861491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:44:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797323358] [2025-03-04 09:44:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:45,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:45,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:45,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2025-03-04 09:44:45,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:45,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:45,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2025-03-04 09:44:45,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand