./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 551b0097 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-?-551b009-m [2025-01-10 00:40:34,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:40:35,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:40:35,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:40:35,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:40:35,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:40:35,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:40:35,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:40:35,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:40:35,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:40:35,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:40:35,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:40:35,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:40:35,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:35,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:35,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:40:35,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:40:35,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:40:35,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:40:35,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:40:35,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:40:35,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:40:35,069 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-01-10 00:40:35,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:40:35,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:40:35,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:40:35,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:40:35,266 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:40:35,266 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-01-10 00:40:36,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4457c0861/5d7074094248443dbb1c5046b4c0300d/FLAG50d7103b8 [2025-01-10 00:40:36,741 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:40:36,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2025-01-10 00:40:36,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4457c0861/5d7074094248443dbb1c5046b4c0300d/FLAG50d7103b8 [2025-01-10 00:40:37,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4457c0861/5d7074094248443dbb1c5046b4c0300d [2025-01-10 00:40:37,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:40:37,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:40:37,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:37,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:40:37,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:40:37,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff858a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37, skipping insertion in model container [2025-01-10 00:40:37,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:40:37,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:40:37,289 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:40:37,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:40:37,349 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:40:37,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37 WrapperNode [2025-01-10 00:40:37,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:37,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:40:37,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:40:37,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:40:37,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,381 INFO L138 Inliner]: procedures = 166, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2025-01-10 00:40:37,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:40:37,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:40:37,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:40:37,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:40:37,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,394 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-01-10 00:40:37,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:40:37,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:40:37,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:40:37,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:40:37,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:40:37,432 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-01-10 00:40:37,437 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-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:40:37,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:40:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:40:37,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:40:37,450 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:40:37,545 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:40:37,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:40:37,696 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:40:37,696 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:40:37,785 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:40:37,785 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 00:40:37,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:37 BoogieIcfgContainer [2025-01-10 00:40:37,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:40:37,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:40:37,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:40:37,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:40:37,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:40:37" (1/3) ... [2025-01-10 00:40:37,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682ae0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:37, skipping insertion in model container [2025-01-10 00:40:37,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37" (2/3) ... [2025-01-10 00:40:37,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682ae0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:37, skipping insertion in model container [2025-01-10 00:40:37,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:37" (3/3) ... [2025-01-10 00:40:37,792 INFO L128 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2025-01-10 00:40:37,805 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:40:37,807 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-01-10 00:40:37,807 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:40:37,843 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:37,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 21 transitions, 46 flow [2025-01-10 00:40:37,895 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-01-10 00:40:37,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:37,900 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 37 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-01-10 00:40:37,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 21 transitions, 46 flow [2025-01-10 00:40:37,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 21 transitions, 46 flow [2025-01-10 00:40:37,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:37,919 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;@5b033b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:37,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 00:40:37,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:37,924 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:37,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:37,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:37,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:37,926 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-01-10 00:40:37,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash 222088, now seen corresponding path program 1 times [2025-01-10 00:40:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:37,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955805619] [2025-01-10 00:40:37,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:37,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:37,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:37,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:38,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955805619] [2025-01-10 00:40:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955805619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:38,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480292711] [2025-01-10 00:40:38,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:38,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:38,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:38,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:38,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:38,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-01-10 00:40:38,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-10 00:40:38,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:38,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-01-10 00:40:38,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:38,101 INFO L124 PetriNetUnfolderBase]: 21/60 cut-off events. [2025-01-10 00:40:38,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:38,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 60 events. 21/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 104 event pairs, 18 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 103. Up to 51 conditions per place. [2025-01-10 00:40:38,107 INFO L140 encePairwiseOnDemand]: 19/21 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2025-01-10 00:40:38,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 64 flow [2025-01-10 00:40:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2025-01-10 00:40:38,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-01-10 00:40:38,118 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 46 flow. Second operand 2 states and 25 transitions. [2025-01-10 00:40:38,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 64 flow [2025-01-10 00:40:38,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:38,123 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 38 flow [2025-01-10 00:40:38,124 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-01-10 00:40:38,127 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -2 predicate places. [2025-01-10 00:40:38,127 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 38 flow [2025-01-10 00:40:38,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-10 00:40:38,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:38,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:38,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:40:38,132 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-01-10 00:40:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash 213482845, now seen corresponding path program 1 times [2025-01-10 00:40:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641316923] [2025-01-10 00:40:38,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:38,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:38,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:38,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:38,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:38,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641316923] [2025-01-10 00:40:38,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641316923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:38,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:38,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:40:38,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651011271] [2025-01-10 00:40:38,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:38,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:38,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:38,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:38,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:38,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-01-10 00:40:38,287 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-01-10 00:40:38,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:38,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-01-10 00:40:38,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:38,338 INFO L124 PetriNetUnfolderBase]: 21/57 cut-off events. [2025-01-10 00:40:38,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:38,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 57 events. 21/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 12 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 109. Up to 35 conditions per place. [2025-01-10 00:40:38,342 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 13 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-01-10 00:40:38,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 18 transitions, 70 flow [2025-01-10 00:40:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-01-10 00:40:38,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-10 00:40:38,350 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 38 flow. Second operand 3 states and 28 transitions. [2025-01-10 00:40:38,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 18 transitions, 70 flow [2025-01-10 00:40:38,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 18 transitions, 70 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:38,351 INFO L231 Difference]: Finished difference. Result has 21 places, 16 transitions, 40 flow [2025-01-10 00:40:38,351 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-01-10 00:40:38,351 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2025-01-10 00:40:38,351 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 16 transitions, 40 flow [2025-01-10 00:40:38,351 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-01-10 00:40:38,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:38,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 00:40:38,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:40:38,352 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-01-10 00:40:38,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1971971426, now seen corresponding path program 1 times [2025-01-10 00:40:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:38,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263719609] [2025-01-10 00:40:38,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:38,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:38,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:38,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:38,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:38,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:38,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:38,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:38,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:38,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:38,425 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:38,426 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-10 00:40:38,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 00:40:38,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-01-10 00:40:38,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-01-10 00:40:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:40:38,428 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 00:40:38,434 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:38,434 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:40:38,471 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:38,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 80 flow [2025-01-10 00:40:38,489 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2025-01-10 00:40:38,489 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:40:38,491 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 101 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-01-10 00:40:38,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 80 flow [2025-01-10 00:40:38,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 80 flow [2025-01-10 00:40:38,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:38,497 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;@5b033b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:38,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 00:40:38,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:38,502 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:38,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:38,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:38,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:38,502 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-01-10 00:40:38,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash 256843, now seen corresponding path program 1 times [2025-01-10 00:40:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:38,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681247168] [2025-01-10 00:40:38,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:38,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:38,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:38,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:38,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:38,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681247168] [2025-01-10 00:40:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681247168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:38,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:38,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:38,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303791776] [2025-01-10 00:40:38,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:38,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:38,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:38,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:38,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-01-10 00:40:38,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 80 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-01-10 00:40:38,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:38,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-01-10 00:40:38,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:38,682 INFO L124 PetriNetUnfolderBase]: 510/930 cut-off events. [2025-01-10 00:40:38,683 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 00:40:38,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 930 events. 510/930 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4086 event pairs, 468 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1108. Up to 801 conditions per place. [2025-01-10 00:40:38,692 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 23 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-01-10 00:40:38,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 116 flow [2025-01-10 00:40:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2025-01-10 00:40:38,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 00:40:38,694 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 80 flow. Second operand 2 states and 42 transitions. [2025-01-10 00:40:38,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 116 flow [2025-01-10 00:40:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:38,695 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 70 flow [2025-01-10 00:40:38,695 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-01-10 00:40:38,695 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2025-01-10 00:40:38,695 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 70 flow [2025-01-10 00:40:38,695 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-01-10 00:40:38,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:38,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:38,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:40:38,696 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-01-10 00:40:38,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 246896429, now seen corresponding path program 1 times [2025-01-10 00:40:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488637160] [2025-01-10 00:40:38,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:38,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:38,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:38,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:38,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:38,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488637160] [2025-01-10 00:40:38,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488637160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:38,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:38,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:40:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10230809] [2025-01-10 00:40:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:38,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:38,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:38,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:38,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:38,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-01-10 00:40:38,752 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-01-10 00:40:38,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:38,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-01-10 00:40:38,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:38,882 INFO L124 PetriNetUnfolderBase]: 525/911 cut-off events. [2025-01-10 00:40:38,882 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 00:40:38,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 911 events. 525/911 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3645 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-01-10 00:40:38,886 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-01-10 00:40:38,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 193 flow [2025-01-10 00:40:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-01-10 00:40:38,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-01-10 00:40:38,887 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 70 flow. Second operand 3 states and 62 transitions. [2025-01-10 00:40:38,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 193 flow [2025-01-10 00:40:38,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:38,889 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 91 flow [2025-01-10 00:40:38,889 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-01-10 00:40:38,890 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-01-10 00:40:38,890 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 91 flow [2025-01-10 00:40:38,890 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-01-10 00:40:38,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:38,890 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 00:40:38,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:40:38,890 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-01-10 00:40:38,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:38,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2014059766, now seen corresponding path program 1 times [2025-01-10 00:40:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262536983] [2025-01-10 00:40:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:38,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:40:38,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:40:38,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:38,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:38,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:40:38,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:40:38,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:38,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:38,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:38,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-10 00:40:38,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 00:40:38,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-01-10 00:40:38,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-01-10 00:40:38,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-01-10 00:40:38,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:40:38,915 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 00:40:38,916 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:38,916 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:40:38,942 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:38,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 116 flow [2025-01-10 00:40:38,950 INFO L124 PetriNetUnfolderBase]: 6/63 cut-off events. [2025-01-10 00:40:38,950 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:40:38,951 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 176 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-01-10 00:40:38,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 49 transitions, 116 flow [2025-01-10 00:40:38,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 49 transitions, 116 flow [2025-01-10 00:40:38,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:38,953 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;@5b033b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:38,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:40:38,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:38,954 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:38,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:38,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:38,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:38,954 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-01-10 00:40:38,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 305500, now seen corresponding path program 1 times [2025-01-10 00:40:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:38,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112971937] [2025-01-10 00:40:38,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:38,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:38,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:38,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:38,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:38,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112971937] [2025-01-10 00:40:38,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112971937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:38,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:38,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:38,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408609820] [2025-01-10 00:40:38,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:38,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:38,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:38,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:38,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:38,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2025-01-10 00:40:38,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-01-10 00:40:38,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:38,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2025-01-10 00:40:38,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:39,856 INFO L124 PetriNetUnfolderBase]: 8088/12296 cut-off events. [2025-01-10 00:40:39,856 INFO L125 PetriNetUnfolderBase]: For 722/722 co-relation queries the response was YES. [2025-01-10 00:40:39,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23733 conditions, 12296 events. 8088/12296 cut-off events. For 722/722 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 72214 event pairs, 7668 based on Foata normal form. 0/10800 useless extension candidates. Maximal degree in co-relation 2600. Up to 11001 conditions per place. [2025-01-10 00:40:39,917 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 33 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2025-01-10 00:40:39,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 170 flow [2025-01-10 00:40:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2025-01-10 00:40:39,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-01-10 00:40:39,919 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 116 flow. Second operand 2 states and 59 transitions. [2025-01-10 00:40:39,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 170 flow [2025-01-10 00:40:39,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 168 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:39,921 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 102 flow [2025-01-10 00:40:39,921 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-01-10 00:40:39,921 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-01-10 00:40:39,921 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 102 flow [2025-01-10 00:40:39,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-01-10 00:40:39,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:39,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:39,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:40:39,922 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-01-10 00:40:39,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash 293669867, now seen corresponding path program 1 times [2025-01-10 00:40:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:39,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861771226] [2025-01-10 00:40:39,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:39,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:39,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:39,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:39,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:39,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:39,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861771226] [2025-01-10 00:40:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861771226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:39,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:39,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:40:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648032624] [2025-01-10 00:40:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:39,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:39,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:39,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:39,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 49 [2025-01-10 00:40:39,946 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-01-10 00:40:39,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:39,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 49 [2025-01-10 00:40:39,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:40,696 INFO L124 PetriNetUnfolderBase]: 9048/13148 cut-off events. [2025-01-10 00:40:40,697 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-01-10 00:40:40,713 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 70099 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-01-10 00:40:40,753 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 57 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2025-01-10 00:40:40,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 284 flow [2025-01-10 00:40:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-01-10 00:40:40,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2025-01-10 00:40:40,757 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 102 flow. Second operand 3 states and 88 transitions. [2025-01-10 00:40:40,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 284 flow [2025-01-10 00:40:40,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 284 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:40,760 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 132 flow [2025-01-10 00:40:40,760 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-01-10 00:40:40,760 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2025-01-10 00:40:40,760 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 132 flow [2025-01-10 00:40:40,761 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-01-10 00:40:40,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:40,761 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-10 00:40:40,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:40:40,761 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-01-10 00:40:40,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2108101635, now seen corresponding path program 1 times [2025-01-10 00:40:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548674469] [2025-01-10 00:40:40,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:40,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:40,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:40:40,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:40:40,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:40,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:40,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:40:40,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:40:40,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:40,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:40,789 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:40,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 00:40:40,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:40:40,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:40:40,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-01-10 00:40:40,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-01-10 00:40:40,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:40:40,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:40:40,790 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 00:40:40,790 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:40,790 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 00:40:40,818 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:40,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 63 transitions, 154 flow [2025-01-10 00:40:40,827 INFO L124 PetriNetUnfolderBase]: 8/82 cut-off events. [2025-01-10 00:40:40,827 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:40:40,827 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-01-10 00:40:40,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 63 transitions, 154 flow [2025-01-10 00:40:40,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 63 transitions, 154 flow [2025-01-10 00:40:40,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:40,830 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;@5b033b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:40,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:40:40,831 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:40,831 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:40,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:40,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:40,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:40,832 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-01-10 00:40:40,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:40,833 INFO L85 PathProgramCache]: Analyzing trace with hash 368059, now seen corresponding path program 1 times [2025-01-10 00:40:40,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:40,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697642109] [2025-01-10 00:40:40,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:40,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:40,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697642109] [2025-01-10 00:40:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697642109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888075454] [2025-01-10 00:40:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:40,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:40,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:40,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:40,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 63 [2025-01-10 00:40:40,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 154 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-01-10 00:40:40,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:40,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 63 [2025-01-10 00:40:40,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:48,373 INFO L124 PetriNetUnfolderBase]: 110868/152924 cut-off events. [2025-01-10 00:40:48,373 INFO L125 PetriNetUnfolderBase]: For 12416/12416 co-relation queries the response was YES. [2025-01-10 00:40:48,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298362 conditions, 152924 events. 110868/152924 cut-off events. For 12416/12416 co-relation queries the response was YES. Maximal size of possible extension queue 3414. Compared 1035505 event pairs, 106668 based on Foata normal form. 0/134616 useless extension candidates. Maximal degree in co-relation 23839. Up to 140001 conditions per place. [2025-01-10 00:40:49,148 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 43 selfloop transitions, 0 changer transitions 0/56 dead transitions. [2025-01-10 00:40:49,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 226 flow [2025-01-10 00:40:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2025-01-10 00:40:49,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-01-10 00:40:49,151 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 154 flow. Second operand 2 states and 76 transitions. [2025-01-10 00:40:49,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 226 flow [2025-01-10 00:40:49,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 220 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:49,161 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 134 flow [2025-01-10 00:40:49,161 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-01-10 00:40:49,162 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-01-10 00:40:49,162 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 134 flow [2025-01-10 00:40:49,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-01-10 00:40:49,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:49,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:49,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:40:49,163 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-01-10 00:40:49,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash 353803991, now seen corresponding path program 1 times [2025-01-10 00:40:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:49,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505731106] [2025-01-10 00:40:49,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:49,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:49,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:49,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:49,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:49,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505731106] [2025-01-10 00:40:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505731106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:49,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:49,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:40:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029400829] [2025-01-10 00:40:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:49,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:49,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:49,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:49,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2025-01-10 00:40:49,210 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-01-10 00:40:49,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:49,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2025-01-10 00:40:49,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:57,864 INFO L124 PetriNetUnfolderBase]: 138114/182648 cut-off events. [2025-01-10 00:40:57,864 INFO L125 PetriNetUnfolderBase]: For 4666/4666 co-relation queries the response was YES. [2025-01-10 00:40:58,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365566 conditions, 182648 events. 138114/182648 cut-off events. For 4666/4666 co-relation queries the response was YES. Maximal size of possible extension queue 3636. Compared 1115823 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-01-10 00:40:58,968 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-01-10 00:40:58,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 375 flow [2025-01-10 00:40:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-01-10 00:40:58,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-01-10 00:40:58,969 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 134 flow. Second operand 3 states and 114 transitions. [2025-01-10 00:40:58,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 375 flow [2025-01-10 00:40:58,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:58,982 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 173 flow [2025-01-10 00:40:58,983 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-01-10 00:40:58,989 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2025-01-10 00:40:58,989 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 173 flow [2025-01-10 00:40:58,990 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-01-10 00:40:58,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:58,990 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:58,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:40:58,990 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-01-10 00:40:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1794292115, now seen corresponding path program 1 times [2025-01-10 00:40:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-01-10 00:40:58,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:58,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:40:59,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:40:59,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:59,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:59,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:59,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:40:59,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:40:59,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:59,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:59,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:59,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:59,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-10 00:40:59,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:40:59,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:40:59,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-01-10 00:40:59,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-01-10 00:40:59,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:40:59,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:40:59,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:40:59,031 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 00:40:59,031 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:59,031 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-10 00:40:59,077 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:59,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 194 flow [2025-01-10 00:40:59,087 INFO L124 PetriNetUnfolderBase]: 10/101 cut-off events. [2025-01-10 00:40:59,089 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 00:40:59,090 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 8. Compared 310 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-01-10 00:40:59,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 194 flow [2025-01-10 00:40:59,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 77 transitions, 194 flow [2025-01-10 00:40:59,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:59,093 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;@5b033b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:59,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:40:59,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:59,094 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:59,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:59,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:59,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:59,095 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-01-10 00:40:59,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 444520, now seen corresponding path program 1 times [2025-01-10 00:40:59,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:59,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687802690] [2025-01-10 00:40:59,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:59,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:59,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:59,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:59,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:59,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:59,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687802690] [2025-01-10 00:40:59,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687802690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:59,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998785398] [2025-01-10 00:40:59,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:59,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:59,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:59,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:59,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 77 [2025-01-10 00:40:59,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:59,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:59,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 77 [2025-01-10 00:40:59,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand