./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:37:36,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:37:36,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:37:36,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:37:36,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:37:36,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:37:36,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:37:36,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:37:36,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:37:36,501 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:37:36,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:37:36,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:37:36,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:37:36,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:37:36,502 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:37:36,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:37:36,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:37:36,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:37:36,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:37:36,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:37:36,503 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:37:36,503 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:37:36,503 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:37:36,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:37:36,504 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:37:36,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:37:36,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:37:36,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:37:36,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:37:36,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:37:36,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:37:36,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:37:36,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:37:36,505 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed [2025-02-06 12:37:36,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:37:36,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:37:36,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:37:36,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:37:36,761 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:37:36,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2025-02-06 12:37:38,109 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5e46face/2c722489fcac45d8b90a703d9d70895b/FLAG6978133a0 [2025-02-06 12:37:38,385 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:37:38,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2025-02-06 12:37:38,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5e46face/2c722489fcac45d8b90a703d9d70895b/FLAG6978133a0 [2025-02-06 12:37:38,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5e46face/2c722489fcac45d8b90a703d9d70895b [2025-02-06 12:37:38,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:37:38,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:37:38,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:37:38,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:37:38,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:37:38,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38, skipping insertion in model container [2025-02-06 12:37:38,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:37:38,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:37:38,760 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:37:38,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:37:38,820 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:37:38,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38 WrapperNode [2025-02-06 12:37:38,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:37:38,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:37:38,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:37:38,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:37:38,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,854 INFO L138 Inliner]: procedures = 166, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2025-02-06 12:37:38,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:37:38,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:37:38,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:37:38,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:37:38,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,870 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-02-06 12:37:38,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:37:38,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:37:38,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:37:38,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:37:38,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (1/1) ... [2025-02-06 12:37:38,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:37:38,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:37:38,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:37:38,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:37:38,928 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:37:38,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:37:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:37:38,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:37:38,930 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:37:39,027 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:37:39,029 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:37:39,233 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:37:39,233 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:37:39,320 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:37:39,320 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:37:39,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:39 BoogieIcfgContainer [2025-02-06 12:37:39,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:37:39,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:37:39,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:37:39,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:37:39,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:37:38" (1/3) ... [2025-02-06 12:37:39,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76816ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:39, skipping insertion in model container [2025-02-06 12:37:39,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:38" (2/3) ... [2025-02-06 12:37:39,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76816ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:39, skipping insertion in model container [2025-02-06 12:37:39,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:39" (3/3) ... [2025-02-06 12:37:39,331 INFO L128 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2025-02-06 12:37:39,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:37:39,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 39_rand_lock_p0_vs.i that has 2 procedures, 19 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 12:37:39,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:37:39,395 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:39,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 21 transitions, 46 flow [2025-02-06 12:37:39,458 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-02-06 12:37:39,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:39,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 2/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-02-06 12:37:39,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 21 transitions, 46 flow [2025-02-06 12:37:39,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 21 transitions, 46 flow [2025-02-06 12:37:39,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:39,499 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;@32ffbd19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:39,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 12:37:39,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:39,505 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:37:39,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:39,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:39,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:37:39,506 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-02-06 12:37:39,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash 183842, now seen corresponding path program 1 times [2025-02-06 12:37:39,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:39,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11023614] [2025-02-06 12:37:39,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:39,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:37:39,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:37:39,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:39,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11023614] [2025-02-06 12:37:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11023614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:39,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:39,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133004561] [2025-02-06 12:37:39,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:39,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:39,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:39,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:39,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:39,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-02-06 12:37:39,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:39,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:39,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-02-06 12:37:39,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:39,682 INFO L124 PetriNetUnfolderBase]: 23/63 cut-off events. [2025-02-06 12:37:39,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:39,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 63 events. 23/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 20 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 110. Up to 56 conditions per place. [2025-02-06 12:37:39,684 INFO L140 encePairwiseOnDemand]: 19/21 looper letters, 14 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2025-02-06 12:37:39,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 66 flow [2025-02-06 12:37:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2025-02-06 12:37:39,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-06 12:37:39,694 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 46 flow. Second operand 2 states and 24 transitions. [2025-02-06 12:37:39,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 66 flow [2025-02-06 12:37:39,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 66 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:39,698 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 38 flow [2025-02-06 12:37:39,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=20, PETRI_TRANSITIONS=17} [2025-02-06 12:37:39,702 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -2 predicate places. [2025-02-06 12:37:39,702 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 38 flow [2025-02-06 12:37:39,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:39,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:39,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:39,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:37:39,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:37:39,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:39,703 INFO L85 PathProgramCache]: Analyzing trace with hash 176728696, now seen corresponding path program 1 times [2025-02-06 12:37:39,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:39,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611404620] [2025-02-06 12:37:39,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:39,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:39,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:39,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:39,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:39,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:39,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611404620] [2025-02-06 12:37:39,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611404620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:39,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:37:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804999117] [2025-02-06 12:37:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:39,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:39,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:39,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:39,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-02-06 12:37:39,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:39,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:39,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-02-06 12:37:39,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:39,900 INFO L124 PetriNetUnfolderBase]: 21/58 cut-off events. [2025-02-06 12:37:39,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:39,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 58 events. 21/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 12 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 110. Up to 35 conditions per place. [2025-02-06 12:37:39,901 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 13 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-02-06 12:37:39,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 18 transitions, 70 flow [2025-02-06 12:37:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-02-06 12:37:39,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-02-06 12:37:39,905 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 38 flow. Second operand 3 states and 28 transitions. [2025-02-06 12:37:39,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 18 transitions, 70 flow [2025-02-06 12:37:39,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 18 transitions, 70 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:39,907 INFO L231 Difference]: Finished difference. Result has 21 places, 16 transitions, 40 flow [2025-02-06 12:37:39,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=16} [2025-02-06 12:37:39,907 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2025-02-06 12:37:39,907 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 16 transitions, 40 flow [2025-02-06 12:37:39,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:39,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:39,908 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 12:37:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:37:39,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:37:39,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1183613323, now seen corresponding path program 1 times [2025-02-06 12:37:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637601641] [2025-02-06 12:37:39,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:39,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:37:39,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:37:39,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:39,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:39,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:37:39,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:37:39,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:39,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:39,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:39,952 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:39,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-06 12:37:39,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-02-06 12:37:39,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-02-06 12:37:39,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-02-06 12:37:39,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:37:39,954 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:37:39,956 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:39,956 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:37:39,975 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:39,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 80 flow [2025-02-06 12:37:39,989 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2025-02-06 12:37:39,989 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:37:39,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 44 events. 4/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2025-02-06 12:37:39,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 80 flow [2025-02-06 12:37:39,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 80 flow [2025-02-06 12:37:39,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:39,992 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;@32ffbd19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:39,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 12:37:39,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:39,993 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:37:39,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:39,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:39,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:37:39,993 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-02-06 12:37:39,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash 218597, now seen corresponding path program 1 times [2025-02-06 12:37:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000994399] [2025-02-06 12:37:39,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:40,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:37:40,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:37:40,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:40,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:40,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000994399] [2025-02-06 12:37:40,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000994399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:40,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:40,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370849803] [2025-02-06 12:37:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:40,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:40,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:40,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:40,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-02-06 12:37:40,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 80 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:40,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:40,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-02-06 12:37:40,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:40,195 INFO L124 PetriNetUnfolderBase]: 609/1050 cut-off events. [2025-02-06 12:37:40,196 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-06 12:37:40,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1050 events. 609/1050 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4321 event pairs, 570 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1348. Up to 969 conditions per place. [2025-02-06 12:37:40,207 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 25 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-02-06 12:37:40,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 120 flow [2025-02-06 12:37:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2025-02-06 12:37:40,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-06 12:37:40,209 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 80 flow. Second operand 2 states and 40 transitions. [2025-02-06 12:37:40,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 120 flow [2025-02-06 12:37:40,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:40,211 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 70 flow [2025-02-06 12:37:40,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-02-06 12:37:40,212 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-02-06 12:37:40,212 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 70 flow [2025-02-06 12:37:40,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:40,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:40,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:37:40,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:37:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash 210142280, now seen corresponding path program 1 times [2025-02-06 12:37:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626695532] [2025-02-06 12:37:40,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:40,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:40,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:40,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:40,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626695532] [2025-02-06 12:37:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626695532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:40,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:40,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:37:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011556709] [2025-02-06 12:37:40,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:40,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:40,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:40,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-02-06 12:37:40,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:40,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:40,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-02-06 12:37:40,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:40,408 INFO L124 PetriNetUnfolderBase]: 525/911 cut-off events. [2025-02-06 12:37:40,408 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-06 12:37:40,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 911 events. 525/911 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3652 event pairs, 252 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1785. Up to 451 conditions per place. [2025-02-06 12:37:40,414 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-02-06 12:37:40,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 193 flow [2025-02-06 12:37:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-02-06 12:37:40,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-02-06 12:37:40,416 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 70 flow. Second operand 3 states and 62 transitions. [2025-02-06 12:37:40,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 193 flow [2025-02-06 12:37:40,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:40,418 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 91 flow [2025-02-06 12:37:40,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-02-06 12:37:40,420 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-02-06 12:37:40,420 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 91 flow [2025-02-06 12:37:40,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:40,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:40,421 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-06 12:37:40,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:37:40,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:37:40,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2061964389, now seen corresponding path program 1 times [2025-02-06 12:37:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032167571] [2025-02-06 12:37:40,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:40,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:40,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:40,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:40,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:40,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:40,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:40,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:40,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:40,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:40,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:40,453 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:40,453 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 12:37:40,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-06 12:37:40,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-02-06 12:37:40,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-02-06 12:37:40,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-06 12:37:40,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:37:40,454 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:37:40,454 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:40,454 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:37:40,476 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:40,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 116 flow [2025-02-06 12:37:40,481 INFO L124 PetriNetUnfolderBase]: 6/63 cut-off events. [2025-02-06 12:37:40,481 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:37:40,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 6/63 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 172 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place. [2025-02-06 12:37:40,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 49 transitions, 116 flow [2025-02-06 12:37:40,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 49 transitions, 116 flow [2025-02-06 12:37:40,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:40,483 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;@32ffbd19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:40,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:37:40,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:40,488 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:37:40,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:40,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:40,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:37:40,488 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-02-06 12:37:40,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash 267254, now seen corresponding path program 1 times [2025-02-06 12:37:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566132716] [2025-02-06 12:37:40,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:40,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:37:40,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:37:40,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:40,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566132716] [2025-02-06 12:37:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566132716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:40,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594497917] [2025-02-06 12:37:40,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:40,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:40,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:40,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:40,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2025-02-06 12:37:40,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:40,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:40,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2025-02-06 12:37:40,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:41,631 INFO L124 PetriNetUnfolderBase]: 10649/15471 cut-off events. [2025-02-06 12:37:41,632 INFO L125 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2025-02-06 12:37:41,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30636 conditions, 15471 events. 10649/15471 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 83552 event pairs, 10250 based on Foata normal form. 0/13835 useless extension candidates. Maximal degree in co-relation 6904. Up to 14642 conditions per place. [2025-02-06 12:37:41,744 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 36 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2025-02-06 12:37:41,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 176 flow [2025-02-06 12:37:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2025-02-06 12:37:41,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-06 12:37:41,745 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 116 flow. Second operand 2 states and 56 transitions. [2025-02-06 12:37:41,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 176 flow [2025-02-06 12:37:41,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 174 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:41,747 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 102 flow [2025-02-06 12:37:41,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-02-06 12:37:41,748 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-02-06 12:37:41,748 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 102 flow [2025-02-06 12:37:41,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:41,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:41,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:41,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:37:41,748 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-02-06 12:37:41,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash 256915718, now seen corresponding path program 1 times [2025-02-06 12:37:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:41,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208696665] [2025-02-06 12:37:41,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:41,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:41,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:41,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:41,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:41,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-02-06 12:37:41,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:41,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208696665] [2025-02-06 12:37:41,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208696665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:41,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:41,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:37:41,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553460687] [2025-02-06 12:37:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:41,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:41,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:41,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:41,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:41,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2025-02-06 12:37:41,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:41,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:41,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2025-02-06 12:37:41,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:42,567 INFO L124 PetriNetUnfolderBase]: 9048/13148 cut-off events. [2025-02-06 12:37:42,567 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-02-06 12:37:42,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26145 conditions, 13148 events. 9048/13148 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 70043 event pairs, 3549 based on Foata normal form. 0/12344 useless extension candidates. Maximal degree in co-relation 26139. Up to 8869 conditions per place. [2025-02-06 12:37:42,644 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 57 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2025-02-06 12:37:42,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 284 flow [2025-02-06 12:37:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-06 12:37:42,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2025-02-06 12:37:42,647 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 102 flow. Second operand 3 states and 88 transitions. [2025-02-06 12:37:42,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 284 flow [2025-02-06 12:37:42,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 284 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:42,651 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 132 flow [2025-02-06 12:37:42,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-02-06 12:37:42,652 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2025-02-06 12:37:42,653 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 132 flow [2025-02-06 12:37:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:42,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:42,653 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-06 12:37:42,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:37:42,653 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-02-06 12:37:42,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash -587918294, now seen corresponding path program 1 times [2025-02-06 12:37:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:42,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-02-06 12:37:42,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:42,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:42,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:37:42,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:37:42,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:42,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:42,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:42,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:37:42,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:37:42,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:42,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:42,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:42,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:42,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 12:37:42,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:37:42,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:37:42,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-02-06 12:37:42,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-06 12:37:42,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:37:42,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:37:42,678 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:37:42,679 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:42,679 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:37:42,712 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:42,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 63 transitions, 154 flow [2025-02-06 12:37:42,721 INFO L124 PetriNetUnfolderBase]: 8/82 cut-off events. [2025-02-06 12:37:42,721 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:37:42,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 82 events. 8/82 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 251 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 75. Up to 5 conditions per place. [2025-02-06 12:37:42,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 63 transitions, 154 flow [2025-02-06 12:37:42,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 63 transitions, 154 flow [2025-02-06 12:37:42,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:42,724 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;@32ffbd19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:42,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:37:42,725 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:42,725 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:37:42,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:42,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:42,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:37:42,726 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-02-06 12:37:42,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:42,726 INFO L85 PathProgramCache]: Analyzing trace with hash 329813, now seen corresponding path program 1 times [2025-02-06 12:37:42,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:42,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654916518] [2025-02-06 12:37:42,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:42,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:37:42,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:37:42,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:42,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:42,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:42,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654916518] [2025-02-06 12:37:42,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654916518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:42,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:42,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:42,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555727071] [2025-02-06 12:37:42,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:42,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:42,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:42,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:42,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:42,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-02-06 12:37:42,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 154 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:42,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:42,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-02-06 12:37:42,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:52,527 INFO L124 PetriNetUnfolderBase]: 161019/213980 cut-off events. [2025-02-06 12:37:52,527 INFO L125 PetriNetUnfolderBase]: For 15653/15653 co-relation queries the response was YES. [2025-02-06 12:37:53,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426134 conditions, 213980 events. 161019/213980 cut-off events. For 15653/15653 co-relation queries the response was YES. Maximal size of possible extension queue 3807. Compared 1323168 event pairs, 156660 based on Foata normal form. 0/191621 useless extension candidates. Maximal degree in co-relation 30764. Up to 204975 conditions per place. [2025-02-06 12:37:53,940 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 47 selfloop transitions, 0 changer transitions 0/56 dead transitions. [2025-02-06 12:37:53,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 234 flow [2025-02-06 12:37:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2025-02-06 12:37:53,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-06 12:37:53,951 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 154 flow. Second operand 2 states and 72 transitions. [2025-02-06 12:37:53,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 234 flow [2025-02-06 12:37:53,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 228 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:53,981 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 134 flow [2025-02-06 12:37:53,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-02-06 12:37:53,982 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-02-06 12:37:53,982 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 134 flow [2025-02-06 12:37:53,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:53,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:53,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:53,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:37:53,983 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-02-06 12:37:53,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash 317049842, now seen corresponding path program 1 times [2025-02-06 12:37:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513243463] [2025-02-06 12:37:53,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:53,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:53,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:53,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:53,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513243463] [2025-02-06 12:37:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513243463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:37:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129743843] [2025-02-06 12:37:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:54,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:54,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:54,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:54,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:54,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-02-06 12:37:54,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:54,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:54,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-02-06 12:37:54,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:38:03,059 INFO L124 PetriNetUnfolderBase]: 138114/182648 cut-off events. [2025-02-06 12:38:03,060 INFO L125 PetriNetUnfolderBase]: For 4664/4664 co-relation queries the response was YES. [2025-02-06 12:38:03,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365566 conditions, 182648 events. 138114/182648 cut-off events. For 4664/4664 co-relation queries the response was YES. Maximal size of possible extension queue 3645. Compared 1116239 event pairs, 45867 based on Foata normal form. 0/170309 useless extension candidates. Maximal degree in co-relation 365559. Up to 145462 conditions per place. [2025-02-06 12:38:04,111 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-02-06 12:38:04,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 375 flow [2025-02-06 12:38:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:38:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:38:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-02-06 12:38:04,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-02-06 12:38:04,118 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 134 flow. Second operand 3 states and 114 transitions. [2025-02-06 12:38:04,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 375 flow [2025-02-06 12:38:04,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:38:04,134 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 173 flow [2025-02-06 12:38:04,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-02-06 12:38:04,136 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2025-02-06 12:38:04,136 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 173 flow [2025-02-06 12:38:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:38:04,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:38:04,136 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:38:04,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:38:04,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:38:04,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:38:04,137 INFO L85 PathProgramCache]: Analyzing trace with hash -853958226, now seen corresponding path program 1 times [2025-02-06 12:38:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:38:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453786685] [2025-02-06 12:38:04,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:38:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:38:04,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:38:04,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:38:04,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:38:04,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:38:04,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:38:04,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:38:04,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:38:04,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:38:04,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:38:04,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:38:04,161 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:38:04,161 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 12:38:04,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:38:04,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:38:04,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-02-06 12:38:04,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-06 12:38:04,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 12:38:04,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:38:04,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:38:04,162 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:38:04,162 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:38:04,162 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 12:38:04,194 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:38:04,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 194 flow [2025-02-06 12:38:04,204 INFO L124 PetriNetUnfolderBase]: 10/101 cut-off events. [2025-02-06 12:38:04,204 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 12:38:04,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 101 events. 10/101 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 324 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2025-02-06 12:38:04,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 194 flow [2025-02-06 12:38:04,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 77 transitions, 194 flow [2025-02-06 12:38:04,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:38:04,207 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;@32ffbd19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:38:04,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:38:04,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:38:04,208 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:38:04,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:38:04,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:38:04,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:38:04,209 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-02-06 12:38:04,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:38:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash 406274, now seen corresponding path program 1 times [2025-02-06 12:38:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:38:04,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928206086] [2025-02-06 12:38:04,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:38:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:38:04,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:38:04,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:38:04,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:38:04,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:38:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:38:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:38:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928206086] [2025-02-06 12:38:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928206086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:38:04,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:38:04,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:38:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666110177] [2025-02-06 12:38:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:38:04,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:38:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:38:04,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:38:04,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:38:04,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 77 [2025-02-06 12:38:04,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 194 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-02-06 12:38:04,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:38:04,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 77 [2025-02-06 12:38:04,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand