./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/31_simple_loop5_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 d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:36:58,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:36:58,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:36:58,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:36:58,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:36:58,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:36:58,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:36:58,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:36:58,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:36:58,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:36:58,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:36:58,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:36:58,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:36:58,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:36:58,870 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:36:58,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:36:58,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:36:58,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:36:58,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:36:58,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:36:58,871 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:36:58,871 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:36:58,871 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:36:58,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:36:58,872 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:36:58,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:36:58,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:36:58,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:36:58,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:36:58,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:36:58,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:36:58,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:36:58,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:36:58,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:36:58,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:36:58,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:36:58,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:36:58,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:36:58,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:36:58,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:36:58,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:36:58,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:36:58,874 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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-02-06 12:36:59,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:36:59,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:36:59,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:36:59,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:36:59,171 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:36:59,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-06 12:37:00,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2888bed3a/7d29b348262d4ded93dd27738db4d887/FLAGb735e3329 [2025-02-06 12:37:00,816 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:37:00,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-06 12:37:00,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2888bed3a/7d29b348262d4ded93dd27738db4d887/FLAGb735e3329 [2025-02-06 12:37:00,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2888bed3a/7d29b348262d4ded93dd27738db4d887 [2025-02-06 12:37:00,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:37:00,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:37:00,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:37:00,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:37:00,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:37:00,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:00" (1/1) ... [2025-02-06 12:37:00,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427ace29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:00, skipping insertion in model container [2025-02-06 12:37:00,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:37:00" (1/1) ... [2025-02-06 12:37:00,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:37:01,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:37:01,206 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:37:01,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:37:01,281 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:37:01,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01 WrapperNode [2025-02-06 12:37:01,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:37:01,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:37:01,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:37:01,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:37:01,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,313 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-02-06 12:37:01,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:37:01,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:37:01,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:37:01,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:37:01,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,334 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-02-06 12:37:01,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:37:01,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:37:01,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:37:01,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:37:01,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (1/1) ... [2025-02-06 12:37:01,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:37:01,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:37:01,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:37:01,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:37:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-06 12:37:01,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-06 12:37:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:37:01,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:37:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:37:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:37:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:37:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:37:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:37:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:37:01,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:37:01,398 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:37:01,517 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:37:01,519 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:37:01,658 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:37:01,658 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:37:01,731 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:37:01,731 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:37:01,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:01 BoogieIcfgContainer [2025-02-06 12:37:01,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:37:01,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:37:01,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:37:01,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:37:01,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:37:00" (1/3) ... [2025-02-06 12:37:01,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6442912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:01, skipping insertion in model container [2025-02-06 12:37:01,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:37:01" (2/3) ... [2025-02-06 12:37:01,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6442912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:37:01, skipping insertion in model container [2025-02-06 12:37:01,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:37:01" (3/3) ... [2025-02-06 12:37:01,740 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-02-06 12:37:01,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:37:01,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 28 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-02-06 12:37:01,759 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:37:01,801 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:01,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 72 flow [2025-02-06 12:37:01,858 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2025-02-06 12:37:01,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:01,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 4/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-06 12:37:01,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 72 flow [2025-02-06 12:37:01,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 69 flow [2025-02-06 12:37:01,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:01,888 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;@22f39680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:01,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 12:37:01,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:01,894 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 12:37:01,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:01,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:01,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:01,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:37:01,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash 164353656, now seen corresponding path program 1 times [2025-02-06 12:37:01,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515330139] [2025-02-06 12:37:01,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:01,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:01,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:01,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:01,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:01,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515330139] [2025-02-06 12:37:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515330139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:02,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:02,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:02,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078902626] [2025-02-06 12:37:02,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:02,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:02,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:02,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:02,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-06 12:37:02,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 69 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-02-06 12:37:02,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:02,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-06 12:37:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:02,178 INFO L124 PetriNetUnfolderBase]: 79/178 cut-off events. [2025-02-06 12:37:02,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:02,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 178 events. 79/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 779 event pairs, 66 based on Foata normal form. 64/230 useless extension candidates. Maximal degree in co-relation 317. Up to 136 conditions per place. [2025-02-06 12:37:02,184 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 12 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-02-06 12:37:02,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 77 flow [2025-02-06 12:37:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2025-02-06 12:37:02,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671875 [2025-02-06 12:37:02,199 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 69 flow. Second operand 2 states and 43 transitions. [2025-02-06 12:37:02,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 77 flow [2025-02-06 12:37:02,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:02,206 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 52 flow [2025-02-06 12:37:02,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2025-02-06 12:37:02,212 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -6 predicate places. [2025-02-06 12:37:02,213 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 52 flow [2025-02-06 12:37:02,213 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-02-06 12:37:02,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:02,213 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:02,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:37:02,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:37:02,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash -928024, now seen corresponding path program 1 times [2025-02-06 12:37:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418479080] [2025-02-06 12:37:02,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:02,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:02,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:37:02,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:37:02,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:02,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:02,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:02,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:37:02,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:37:02,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:02,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:02,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:02,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:02,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 12:37:02,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-06 12:37:02,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-02-06 12:37:02,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-06 12:37:02,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-06 12:37:02,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:37:02,302 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:37:02,305 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:02,305 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:37:02,326 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 55 transitions, 130 flow [2025-02-06 12:37:02,344 INFO L124 PetriNetUnfolderBase]: 5/48 cut-off events. [2025-02-06 12:37:02,345 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:37:02,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 48 events. 5/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 55. Up to 3 conditions per place. [2025-02-06 12:37:02,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 55 transitions, 130 flow [2025-02-06 12:37:02,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 39 transitions, 91 flow [2025-02-06 12:37:02,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:02,348 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;@22f39680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:02,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:37:02,352 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:02,353 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-06 12:37:02,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:02,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:02,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:02,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:37:02,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash 217466042, now seen corresponding path program 1 times [2025-02-06 12:37:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:02,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701289288] [2025-02-06 12:37:02,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:02,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:02,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:02,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:02,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:02,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701289288] [2025-02-06 12:37:02,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701289288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:02,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200646700] [2025-02-06 12:37:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:02,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:02,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:02,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:02,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:02,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-02-06 12:37:02,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 91 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:02,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:02,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-02-06 12:37:02,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:02,592 INFO L124 PetriNetUnfolderBase]: 559/1002 cut-off events. [2025-02-06 12:37:02,592 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 12:37:02,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 1002 events. 559/1002 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5545 event pairs, 450 based on Foata normal form. 379/1332 useless extension candidates. Maximal degree in co-relation 1853. Up to 800 conditions per place. [2025-02-06 12:37:02,606 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 16 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-02-06 12:37:02,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 105 flow [2025-02-06 12:37:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2025-02-06 12:37:02,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2025-02-06 12:37:02,608 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 91 flow. Second operand 2 states and 68 transitions. [2025-02-06 12:37:02,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 105 flow [2025-02-06 12:37:02,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:02,610 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 72 flow [2025-02-06 12:37:02,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=72, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-02-06 12:37:02,612 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2025-02-06 12:37:02,612 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 72 flow [2025-02-06 12:37:02,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:02,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:02,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:02,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:37:02,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:37:02,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash -781230148, now seen corresponding path program 1 times [2025-02-06 12:37:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:02,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143238917] [2025-02-06 12:37:02,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:02,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:02,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:02,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143238917] [2025-02-06 12:37:02,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143238917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:02,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:02,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:02,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633347208] [2025-02-06 12:37:02,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:02,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:02,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:02,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:02,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:02,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2025-02-06 12:37:02,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:02,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:02,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2025-02-06 12:37:02,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:02,903 INFO L124 PetriNetUnfolderBase]: 620/1150 cut-off events. [2025-02-06 12:37:02,904 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:37:02,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 1150 events. 620/1150 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6814 event pairs, 139 based on Foata normal form. 20/1127 useless extension candidates. Maximal degree in co-relation 2111. Up to 760 conditions per place. [2025-02-06 12:37:02,911 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 22 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-02-06 12:37:02,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 145 flow [2025-02-06 12:37:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-02-06 12:37:02,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-02-06 12:37:02,913 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 72 flow. Second operand 3 states and 95 transitions. [2025-02-06 12:37:02,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 145 flow [2025-02-06 12:37:02,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 145 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:02,915 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 91 flow [2025-02-06 12:37:02,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=38, PETRI_TRANSITIONS=32} [2025-02-06 12:37:02,916 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2025-02-06 12:37:02,916 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 91 flow [2025-02-06 12:37:02,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:02,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:02,917 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:02,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:37:02,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 12:37:02,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1989361907, now seen corresponding path program 1 times [2025-02-06 12:37:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415812989] [2025-02-06 12:37:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:02,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:37:02,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:37:02,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:02,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:02,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:02,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:37:02,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:37:02,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:02,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:02,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:02,941 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:02,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 12:37:02,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:37:02,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:37:02,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:37:02,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-06 12:37:02,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:37:02,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:37:02,943 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:37:02,943 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:02,943 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:37:02,972 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:02,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 192 flow [2025-02-06 12:37:02,982 INFO L124 PetriNetUnfolderBase]: 6/61 cut-off events. [2025-02-06 12:37:02,983 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:37:02,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 61 events. 6/61 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 72. Up to 4 conditions per place. [2025-02-06 12:37:02,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 78 transitions, 192 flow [2025-02-06 12:37:02,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 47 transitions, 115 flow [2025-02-06 12:37:02,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:02,986 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;@22f39680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:02,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:37:02,989 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:02,990 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 12:37:02,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:02,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:02,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:02,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:37:02,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:02,991 INFO L85 PathProgramCache]: Analyzing trace with hash 292527443, now seen corresponding path program 1 times [2025-02-06 12:37:02,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:02,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753442730] [2025-02-06 12:37:02,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:02,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:03,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:03,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:03,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:03,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753442730] [2025-02-06 12:37:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753442730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:03,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:03,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:03,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042441607] [2025-02-06 12:37:03,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:03,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:03,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:03,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:03,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:03,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 78 [2025-02-06 12:37:03,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 115 flow. Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:03,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:03,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 78 [2025-02-06 12:37:03,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:03,556 INFO L124 PetriNetUnfolderBase]: 3247/5082 cut-off events. [2025-02-06 12:37:03,556 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2025-02-06 12:37:03,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9625 conditions, 5082 events. 3247/5082 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 31275 event pairs, 2562 based on Foata normal form. 2035/6908 useless extension candidates. Maximal degree in co-relation 9613. Up to 4224 conditions per place. [2025-02-06 12:37:03,598 INFO L140 encePairwiseOnDemand]: 71/78 looper letters, 20 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2025-02-06 12:37:03,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 135 flow [2025-02-06 12:37:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2025-02-06 12:37:03,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2025-02-06 12:37:03,602 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 115 flow. Second operand 2 states and 93 transitions. [2025-02-06 12:37:03,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 135 flow [2025-02-06 12:37:03,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 132 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:03,605 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 92 flow [2025-02-06 12:37:03,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-02-06 12:37:03,606 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2025-02-06 12:37:03,607 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 92 flow [2025-02-06 12:37:03,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:03,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:03,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:03,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:37:03,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:37:03,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1353769148, now seen corresponding path program 1 times [2025-02-06 12:37:03,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:03,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302300112] [2025-02-06 12:37:03,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:03,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:03,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:03,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:03,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:03,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302300112] [2025-02-06 12:37:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302300112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:03,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:03,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:03,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535477508] [2025-02-06 12:37:03,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:03,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:03,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:03,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:03,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 78 [2025-02-06 12:37:03,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:03,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:03,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 78 [2025-02-06 12:37:03,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:04,211 INFO L124 PetriNetUnfolderBase]: 3515/5677 cut-off events. [2025-02-06 12:37:04,211 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2025-02-06 12:37:04,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 5677 events. 3515/5677 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 37272 event pairs, 724 based on Foata normal form. 44/5534 useless extension candidates. Maximal degree in co-relation 10577. Up to 4267 conditions per place. [2025-02-06 12:37:04,314 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 28 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-02-06 12:37:04,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 190 flow [2025-02-06 12:37:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2025-02-06 12:37:04,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2025-02-06 12:37:04,317 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 92 flow. Second operand 3 states and 132 transitions. [2025-02-06 12:37:04,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 190 flow [2025-02-06 12:37:04,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:04,319 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 118 flow [2025-02-06 12:37:04,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-02-06 12:37:04,320 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-02-06 12:37:04,320 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 118 flow [2025-02-06 12:37:04,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:04,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:04,322 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:04,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:37:04,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:37:04,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2108139185, now seen corresponding path program 1 times [2025-02-06 12:37:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:04,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310843294] [2025-02-06 12:37:04,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:04,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:37:04,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:37:04,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:04,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:04,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:04,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:37:04,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:37:04,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:04,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:04,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:04,349 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:04,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 12:37:04,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:37:04,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:37:04,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:37:04,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-02-06 12:37:04,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-02-06 12:37:04,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:37:04,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:37:04,350 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 12:37:04,351 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:04,351 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:37:04,384 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:04,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 258 flow [2025-02-06 12:37:04,394 INFO L124 PetriNetUnfolderBase]: 7/74 cut-off events. [2025-02-06 12:37:04,394 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:37:04,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 74 events. 7/74 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 90. Up to 5 conditions per place. [2025-02-06 12:37:04,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 101 transitions, 258 flow [2025-02-06 12:37:04,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 55 transitions, 141 flow [2025-02-06 12:37:04,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:04,399 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;@22f39680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:04,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:37:04,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:04,403 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-06 12:37:04,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:04,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:04,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:04,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 12:37:04,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:04,405 INFO L85 PathProgramCache]: Analyzing trace with hash 389537859, now seen corresponding path program 1 times [2025-02-06 12:37:04,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:04,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233985561] [2025-02-06 12:37:04,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:04,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:04,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:04,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:04,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:04,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233985561] [2025-02-06 12:37:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233985561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495256369] [2025-02-06 12:37:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:04,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:04,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:04,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:04,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-06 12:37:04,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 141 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:04,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:04,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-06 12:37:04,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:06,502 INFO L124 PetriNetUnfolderBase]: 17071/24474 cut-off events. [2025-02-06 12:37:06,502 INFO L125 PetriNetUnfolderBase]: For 4208/4208 co-relation queries the response was YES. [2025-02-06 12:37:06,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47066 conditions, 24474 events. 17071/24474 cut-off events. For 4208/4208 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 159173 event pairs, 13314 based on Foata normal form. 10200/33826 useless extension candidates. Maximal degree in co-relation 47053. Up to 20992 conditions per place. [2025-02-06 12:37:06,806 INFO L140 encePairwiseOnDemand]: 93/101 looper letters, 24 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2025-02-06 12:37:06,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 167 flow [2025-02-06 12:37:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2025-02-06 12:37:06,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5841584158415841 [2025-02-06 12:37:06,809 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 141 flow. Second operand 2 states and 118 transitions. [2025-02-06 12:37:06,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 167 flow [2025-02-06 12:37:06,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 160 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:06,818 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 112 flow [2025-02-06 12:37:06,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=112, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-02-06 12:37:06,818 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2025-02-06 12:37:06,818 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 112 flow [2025-02-06 12:37:06,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:06,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:06,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:06,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:37:06,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 12:37:06,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1574439201, now seen corresponding path program 1 times [2025-02-06 12:37:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:06,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423656041] [2025-02-06 12:37:06,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:06,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:06,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:06,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:06,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:06,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423656041] [2025-02-06 12:37:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423656041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:06,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:06,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:06,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694437087] [2025-02-06 12:37:06,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:06,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:06,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:06,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:06,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:06,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-06 12:37:06,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:06,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:06,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-06 12:37:06,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:08,541 INFO L124 PetriNetUnfolderBase]: 17930/26488 cut-off events. [2025-02-06 12:37:08,542 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2025-02-06 12:37:08,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49842 conditions, 26488 events. 17930/26488 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 184362 event pairs, 3961 based on Foata normal form. 92/25737 useless extension candidates. Maximal degree in co-relation 49835. Up to 21382 conditions per place. [2025-02-06 12:37:08,765 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 34 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-02-06 12:37:08,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 235 flow [2025-02-06 12:37:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-02-06 12:37:08,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5577557755775577 [2025-02-06 12:37:08,767 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 112 flow. Second operand 3 states and 169 transitions. [2025-02-06 12:37:08,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 235 flow [2025-02-06 12:37:08,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 235 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:08,771 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 145 flow [2025-02-06 12:37:08,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-02-06 12:37:08,772 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-02-06 12:37:08,772 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 145 flow [2025-02-06 12:37:08,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:08,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:08,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:08,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:37:08,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 12:37:08,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 199784472, now seen corresponding path program 1 times [2025-02-06 12:37:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:08,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861658403] [2025-02-06 12:37:08,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:08,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:37:08,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:37:08,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:08,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:08,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861658403] [2025-02-06 12:37:08,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861658403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:08,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:08,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:37:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644474406] [2025-02-06 12:37:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:08,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:08,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:08,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:08,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-06 12:37:08,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:08,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:08,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-06 12:37:08,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:09,227 INFO L124 PetriNetUnfolderBase]: 1187/2645 cut-off events. [2025-02-06 12:37:09,228 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-02-06 12:37:09,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5724 conditions, 2645 events. 1187/2645 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18402 event pairs, 260 based on Foata normal form. 2076/4644 useless extension candidates. Maximal degree in co-relation 5715. Up to 1627 conditions per place. [2025-02-06 12:37:09,251 INFO L140 encePairwiseOnDemand]: 91/101 looper letters, 25 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2025-02-06 12:37:09,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 247 flow [2025-02-06 12:37:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-06 12:37:09,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5445544554455446 [2025-02-06 12:37:09,253 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 145 flow. Second operand 3 states and 165 transitions. [2025-02-06 12:37:09,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 247 flow [2025-02-06 12:37:09,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:09,256 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 160 flow [2025-02-06 12:37:09,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-02-06 12:37:09,257 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2025-02-06 12:37:09,257 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 160 flow [2025-02-06 12:37:09,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:09,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:09,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:09,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:37:09,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 12:37:09,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1491480639, now seen corresponding path program 1 times [2025-02-06 12:37:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:09,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682604579] [2025-02-06 12:37:09,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:09,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:09,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:37:09,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:37:09,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:09,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:09,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:09,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682604579] [2025-02-06 12:37:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682604579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:37:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886087492] [2025-02-06 12:37:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:09,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:37:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:09,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:37:09,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:37:09,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-06 12:37:09,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:09,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:09,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-06 12:37:09,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:09,700 INFO L124 PetriNetUnfolderBase]: 1731/3934 cut-off events. [2025-02-06 12:37:09,700 INFO L125 PetriNetUnfolderBase]: For 1177/1207 co-relation queries the response was YES. [2025-02-06 12:37:09,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9571 conditions, 3934 events. 1731/3934 cut-off events. For 1177/1207 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 30587 event pairs, 86 based on Foata normal form. 36/3951 useless extension candidates. Maximal degree in co-relation 9562. Up to 2243 conditions per place. [2025-02-06 12:37:09,736 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 49 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2025-02-06 12:37:09,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 406 flow [2025-02-06 12:37:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:37:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:37:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-02-06 12:37:09,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5717821782178217 [2025-02-06 12:37:09,738 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 160 flow. Second operand 4 states and 231 transitions. [2025-02-06 12:37:09,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 406 flow [2025-02-06 12:37:09,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:09,746 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 202 flow [2025-02-06 12:37:09,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2025-02-06 12:37:09,747 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-02-06 12:37:09,747 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 202 flow [2025-02-06 12:37:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:09,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:09,748 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:37:09,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 12:37:09,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -763080575, now seen corresponding path program 1 times [2025-02-06 12:37:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450664705] [2025-02-06 12:37:09,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:09,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:37:09,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:37:09,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:09,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:09,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:09,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:37:09,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:37:09,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:09,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:09,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:09,785 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:09,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 12:37:09,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-02-06 12:37:09,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-02-06 12:37:09,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-02-06 12:37:09,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-02-06 12:37:09,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-02-06 12:37:09,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-02-06 12:37:09,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-06 12:37:09,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:37:09,786 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 12:37:09,786 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:09,786 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 12:37:09,832 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:09,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 124 transitions, 328 flow [2025-02-06 12:37:09,842 INFO L124 PetriNetUnfolderBase]: 8/87 cut-off events. [2025-02-06 12:37:09,842 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 12:37:09,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 87 events. 8/87 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 246 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2025-02-06 12:37:09,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 124 transitions, 328 flow [2025-02-06 12:37:09,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 63 transitions, 169 flow [2025-02-06 12:37:09,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:09,846 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;@22f39680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:09,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 12:37:09,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:09,847 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 12:37:09,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:09,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:09,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:09,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 12:37:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash 508497290, now seen corresponding path program 1 times [2025-02-06 12:37:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258865190] [2025-02-06 12:37:09,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:09,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:09,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:09,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:09,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:09,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258865190] [2025-02-06 12:37:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258865190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:09,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:09,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375897617] [2025-02-06 12:37:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:09,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:09,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:09,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:09,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 124 [2025-02-06 12:37:09,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 169 flow. Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:09,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:09,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 124 [2025-02-06 12:37:09,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:16,731 INFO L124 PetriNetUnfolderBase]: 84655/114330 cut-off events. [2025-02-06 12:37:16,732 INFO L125 PetriNetUnfolderBase]: For 26992/26992 co-relation queries the response was YES. [2025-02-06 12:37:17,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222427 conditions, 114330 events. 84655/114330 cut-off events. For 26992/26992 co-relation queries the response was YES. Maximal size of possible extension queue 4024. Compared 772073 event pairs, 65538 based on Foata normal form. 48984/159906 useless extension candidates. Maximal degree in co-relation 222413. Up to 100352 conditions per place. [2025-02-06 12:37:17,664 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 28 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2025-02-06 12:37:17,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 201 flow [2025-02-06 12:37:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:37:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:37:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 143 transitions. [2025-02-06 12:37:17,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5766129032258065 [2025-02-06 12:37:17,665 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 169 flow. Second operand 2 states and 143 transitions. [2025-02-06 12:37:17,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 201 flow [2025-02-06 12:37:17,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 188 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:17,682 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 132 flow [2025-02-06 12:37:17,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=132, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2025-02-06 12:37:17,683 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -10 predicate places. [2025-02-06 12:37:17,683 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 132 flow [2025-02-06 12:37:17,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:17,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:17,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:17,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:37:17,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 12:37:17,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 17825921, now seen corresponding path program 1 times [2025-02-06 12:37:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990973491] [2025-02-06 12:37:17,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:17,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:37:17,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:37:17,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:17,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990973491] [2025-02-06 12:37:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990973491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:17,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:17,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064787331] [2025-02-06 12:37:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:17,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:17,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:17,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:17,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 124 [2025-02-06 12:37:17,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:17,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:17,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 124 [2025-02-06 12:37:17,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:24,504 INFO L124 PetriNetUnfolderBase]: 87029/120775 cut-off events. [2025-02-06 12:37:24,504 INFO L125 PetriNetUnfolderBase]: For 5082/5082 co-relation queries the response was YES. [2025-02-06 12:37:24,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228997 conditions, 120775 events. 87029/120775 cut-off events. For 5082/5082 co-relation queries the response was YES. Maximal size of possible extension queue 4420. Compared 875052 event pairs, 21478 based on Foata normal form. 188/117285 useless extension candidates. Maximal degree in co-relation 228989. Up to 101893 conditions per place. [2025-02-06 12:37:25,344 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 40 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2025-02-06 12:37:25,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 280 flow [2025-02-06 12:37:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-02-06 12:37:25,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2025-02-06 12:37:25,346 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 132 flow. Second operand 3 states and 206 transitions. [2025-02-06 12:37:25,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 280 flow [2025-02-06 12:37:25,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 69 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:37:25,353 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 172 flow [2025-02-06 12:37:25,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-02-06 12:37:25,354 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2025-02-06 12:37:25,354 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 172 flow [2025-02-06 12:37:25,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:25,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:25,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:25,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:37:25,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 12:37:25,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1036356982, now seen corresponding path program 1 times [2025-02-06 12:37:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:25,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975362607] [2025-02-06 12:37:25,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:25,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:37:25,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:37:25,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:25,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975362607] [2025-02-06 12:37:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975362607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:25,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:37:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850703791] [2025-02-06 12:37:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:25,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:37:25,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:25,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:37:25,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:37:25,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 124 [2025-02-06 12:37:25,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:25,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:25,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 124 [2025-02-06 12:37:25,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:25,994 INFO L124 PetriNetUnfolderBase]: 2900/6207 cut-off events. [2025-02-06 12:37:25,994 INFO L125 PetriNetUnfolderBase]: For 1688/1688 co-relation queries the response was YES. [2025-02-06 12:37:26,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13571 conditions, 6207 events. 2900/6207 cut-off events. For 1688/1688 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 48928 event pairs, 648 based on Foata normal form. 6162/12224 useless extension candidates. Maximal degree in co-relation 13561. Up to 3945 conditions per place. [2025-02-06 12:37:26,037 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 29 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2025-02-06 12:37:26,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 293 flow [2025-02-06 12:37:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:37:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:37:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-02-06 12:37:26,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2025-02-06 12:37:26,038 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 172 flow. Second operand 3 states and 201 transitions. [2025-02-06 12:37:26,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 293 flow [2025-02-06 12:37:26,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:26,044 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 190 flow [2025-02-06 12:37:26,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-02-06 12:37:26,045 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2025-02-06 12:37:26,045 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 190 flow [2025-02-06 12:37:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:26,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:26,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:26,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:37:26,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 12:37:26,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1239338946, now seen corresponding path program 1 times [2025-02-06 12:37:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:26,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374111767] [2025-02-06 12:37:26,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:26,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:26,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:37:26,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:37:26,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:26,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374111767] [2025-02-06 12:37:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374111767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:26,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:26,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:37:26,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839337876] [2025-02-06 12:37:26,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:26,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:37:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:26,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:37:26,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:37:26,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 124 [2025-02-06 12:37:26,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:26,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:26,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 124 [2025-02-06 12:37:26,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:37:26,965 INFO L124 PetriNetUnfolderBase]: 4045/8702 cut-off events. [2025-02-06 12:37:26,965 INFO L125 PetriNetUnfolderBase]: For 2474/2534 co-relation queries the response was YES. [2025-02-06 12:37:26,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21598 conditions, 8702 events. 4045/8702 cut-off events. For 2474/2534 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 73573 event pairs, 162 based on Foata normal form. 57/8736 useless extension candidates. Maximal degree in co-relation 21588. Up to 5638 conditions per place. [2025-02-06 12:37:27,036 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 58 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2025-02-06 12:37:27,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 488 flow [2025-02-06 12:37:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:37:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:37:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-02-06 12:37:27,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685483870967742 [2025-02-06 12:37:27,038 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 190 flow. Second operand 4 states and 282 transitions. [2025-02-06 12:37:27,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 488 flow [2025-02-06 12:37:27,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:37:27,048 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 242 flow [2025-02-06 12:37:27,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-02-06 12:37:27,048 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2025-02-06 12:37:27,049 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 242 flow [2025-02-06 12:37:27,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:27,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:27,049 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:37:27,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:37:27,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 12:37:27,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash -117632198, now seen corresponding path program 1 times [2025-02-06 12:37:27,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:27,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005750513] [2025-02-06 12:37:27,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:27,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:37:27,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:37:27,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:27,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:27,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:37:27,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:37:27,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:37:27,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:27,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:37:27,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:37:27,086 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:37:27,086 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-06 12:37:27,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2025-02-06 12:37:27,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2025-02-06 12:37:27,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2025-02-06 12:37:27,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2025-02-06 12:37:27,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-02-06 12:37:27,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-02-06 12:37:27,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-02-06 12:37:27,087 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-02-06 12:37:27,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:37:27,087 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 12:37:27,088 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:37:27,088 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-02-06 12:37:27,127 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:37:27,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 147 transitions, 402 flow [2025-02-06 12:37:27,138 INFO L124 PetriNetUnfolderBase]: 9/100 cut-off events. [2025-02-06 12:37:27,138 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-06 12:37:27,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 100 events. 9/100 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 296 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 129. Up to 7 conditions per place. [2025-02-06 12:37:27,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 147 transitions, 402 flow [2025-02-06 12:37:27,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 71 transitions, 199 flow [2025-02-06 12:37:27,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:37:27,141 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;@22f39680, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:37:27,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 12:37:27,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:37:27,143 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-02-06 12:37:27,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:37:27,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:37:27,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:37:27,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-02-06 12:37:27,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:37:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash 649405736, now seen corresponding path program 1 times [2025-02-06 12:37:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:37:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071432064] [2025-02-06 12:37:27,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:37:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:37:27,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:37:27,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:37:27,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:37:27,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:37:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:37:27,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:37:27,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071432064] [2025-02-06 12:37:27,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071432064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:37:27,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:37:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:37:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606540912] [2025-02-06 12:37:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:37:27,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:37:27,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:37:27,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:37:27,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:37:27,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 147 [2025-02-06 12:37:27,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 199 flow. Second operand has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:37:27,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:37:27,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 147 [2025-02-06 12:37:27,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand