./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22ba795826618dfa50b90a88d5a4c30adee7dfead438325f939eb97a379da897 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:58:05,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:58:05,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:58:05,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:58:05,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:58:05,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:58:05,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:58:05,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:58:05,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:58:05,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:58:05,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:58:05,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:58:05,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:58:05,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:58:05,170 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:58:05,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:58:05,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:58:05,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:58:05,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:58:05,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:58:05,171 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:58:05,171 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:58:05,171 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:58:05,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:58:05,172 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:58:05,172 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:58:05,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:58:05,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:58:05,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:58:05,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:58:05,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:58:05,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:58:05,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:58:05,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:58:05,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:58:05,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:58:05,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:58:05,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:58:05,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:58:05,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:58:05,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:58:05,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:58:05,174 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22ba795826618dfa50b90a88d5a4c30adee7dfead438325f939eb97a379da897 [2025-03-09 00:58:05,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:58:05,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:58:05,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:58:05,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:58:05,398 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:58:05,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2025-03-09 00:58:06,519 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb2264cd/516bc4c2b0ee4f17bf8a11093b415364/FLAG4b88ce2c8 [2025-03-09 00:58:06,800 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:58:06,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2025-03-09 00:58:06,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb2264cd/516bc4c2b0ee4f17bf8a11093b415364/FLAG4b88ce2c8 [2025-03-09 00:58:07,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb2264cd/516bc4c2b0ee4f17bf8a11093b415364 [2025-03-09 00:58:07,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:58:07,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:58:07,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:58:07,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:58:07,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:58:07,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d30aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07, skipping insertion in model container [2025-03-09 00:58:07,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:58:07,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:58:07,410 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:58:07,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:58:07,462 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:58:07,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07 WrapperNode [2025-03-09 00:58:07,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:58:07,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:58:07,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:58:07,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:58:07,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,487 INFO L138 Inliner]: procedures = 164, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2025-03-09 00:58:07,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:58:07,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:58:07,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:58:07,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:58:07,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,502 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-09 00:58:07,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:58:07,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:58:07,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:58:07,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:58:07,514 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (1/1) ... [2025-03-09 00:58:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:58:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:58:07,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:58:07,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:58:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-09 00:58:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-09 00:58:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-09 00:58:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-09 00:58:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:58:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:58:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:58:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:58:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:58:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:58:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:58:07,569 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:58:07,673 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:58:07,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:58:07,799 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:58:07,800 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:58:07,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:58:07,868 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:58:07,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:58:07 BoogieIcfgContainer [2025-03-09 00:58:07,868 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:58:07,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:58:07,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:58:07,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:58:07,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:58:07" (1/3) ... [2025-03-09 00:58:07,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be8a1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:58:07, skipping insertion in model container [2025-03-09 00:58:07,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:07" (2/3) ... [2025-03-09 00:58:07,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be8a1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:58:07, skipping insertion in model container [2025-03-09 00:58:07,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:58:07" (3/3) ... [2025-03-09 00:58:07,876 INFO L128 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs.i [2025-03-09 00:58:07,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:58:07,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 35_double_lock_p3_vs.i that has 3 procedures, 32 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-09 00:58:07,888 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:58:07,929 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:58:07,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 80 flow [2025-03-09 00:58:07,975 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2025-03-09 00:58:07,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:07,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 39 events. 4/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 90 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-09 00:58:07,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 80 flow [2025-03-09 00:58:07,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 35 transitions, 77 flow [2025-03-09 00:58:07,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:58:07,994 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;@76f7caa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:58:07,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 00:58:07,998 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:58:07,998 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-09 00:58:07,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:07,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:07,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:58:07,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 00:58:08,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash 202606938, now seen corresponding path program 1 times [2025-03-09 00:58:08,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:08,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961056476] [2025-03-09 00:58:08,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:08,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:58:08,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:58:08,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:08,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:58:08,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961056476] [2025-03-09 00:58:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961056476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:08,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308071415] [2025-03-09 00:58:08,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:08,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:58:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:08,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:58:08,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:58:08,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-09 00:58:08,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:08,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:08,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-09 00:58:08,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:08,233 INFO L124 PetriNetUnfolderBase]: 198/364 cut-off events. [2025-03-09 00:58:08,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:08,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 364 events. 198/364 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1710 event pairs, 185 based on Foata normal form. 71/420 useless extension candidates. Maximal degree in co-relation 710. Up to 343 conditions per place. [2025-03-09 00:58:08,237 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 20 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2025-03-09 00:58:08,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 103 flow [2025-03-09 00:58:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:58:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:58:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2025-03-09 00:58:08,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-09 00:58:08,247 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 77 flow. Second operand 2 states and 44 transitions. [2025-03-09 00:58:08,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 103 flow [2025-03-09 00:58:08,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:58:08,251 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 62 flow [2025-03-09 00:58:08,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2025-03-09 00:58:08,254 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2025-03-09 00:58:08,255 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 62 flow [2025-03-09 00:58:08,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:08,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:08,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:08,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:58:08,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 00:58:08,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:08,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2011712430, now seen corresponding path program 1 times [2025-03-09 00:58:08,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:08,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662413117] [2025-03-09 00:58:08,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:08,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:58:08,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:58:08,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:08,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:58:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662413117] [2025-03-09 00:58:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662413117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:08,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571367291] [2025-03-09 00:58:08,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:08,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:58:08,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:08,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:58:08,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:58:08,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-09 00:58:08,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:08,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:08,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-09 00:58:08,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:08,408 INFO L124 PetriNetUnfolderBase]: 140/264 cut-off events. [2025-03-09 00:58:08,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:08,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 264 events. 140/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1129 event pairs, 130 based on Foata normal form. 35/288 useless extension candidates. Maximal degree in co-relation 520. Up to 248 conditions per place. [2025-03-09 00:58:08,410 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 18 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2025-03-09 00:58:08,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 94 flow [2025-03-09 00:58:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:58:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:58:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-09 00:58:08,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2025-03-09 00:58:08,411 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 62 flow. Second operand 3 states and 50 transitions. [2025-03-09 00:58:08,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 94 flow [2025-03-09 00:58:08,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:08,413 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 58 flow [2025-03-09 00:58:08,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-03-09 00:58:08,413 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2025-03-09 00:58:08,413 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 58 flow [2025-03-09 00:58:08,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:08,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:08,414 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:08,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:58:08,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 00:58:08,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1436664025, now seen corresponding path program 1 times [2025-03-09 00:58:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:08,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389319967] [2025-03-09 00:58:08,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:08,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:58:08,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:58:08,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:08,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:08,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:58:08,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:58:08,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:58:08,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:08,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:08,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:58:08,456 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:58:08,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-09 00:58:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-09 00:58:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-03-09 00:58:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-09 00:58:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-09 00:58:08,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:58:08,459 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 00:58:08,461 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:58:08,462 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 00:58:08,492 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:58:08,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 63 transitions, 146 flow [2025-03-09 00:58:08,506 INFO L124 PetriNetUnfolderBase]: 5/57 cut-off events. [2025-03-09 00:58:08,507 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:58:08,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 57 events. 5/57 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 64. Up to 3 conditions per place. [2025-03-09 00:58:08,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 63 transitions, 146 flow [2025-03-09 00:58:08,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 48 transitions, 109 flow [2025-03-09 00:58:08,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:58:08,509 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;@76f7caa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:58:08,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 00:58:08,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:58:08,511 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-09 00:58:08,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:08,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:08,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:58:08,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 00:58:08,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 263502719, now seen corresponding path program 1 times [2025-03-09 00:58:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:08,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040208734] [2025-03-09 00:58:08,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:08,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:58:08,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:58:08,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:08,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:58:08,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040208734] [2025-03-09 00:58:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040208734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:08,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:08,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634635313] [2025-03-09 00:58:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:58:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:08,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:58:08,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:58:08,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 63 [2025-03-09 00:58:08,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 109 flow. Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:08,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:08,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 63 [2025-03-09 00:58:08,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:08,982 INFO L124 PetriNetUnfolderBase]: 3751/5537 cut-off events. [2025-03-09 00:58:08,983 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-03-09 00:58:08,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11031 conditions, 5537 events. 3751/5537 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 32060 event pairs, 3474 based on Foata normal form. 797/6018 useless extension candidates. Maximal degree in co-relation 11020. Up to 5348 conditions per place. [2025-03-09 00:58:09,020 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 32 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2025-03-09 00:58:09,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 159 flow [2025-03-09 00:58:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:58:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:58:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2025-03-09 00:58:09,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 00:58:09,021 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 109 flow. Second operand 2 states and 70 transitions. [2025-03-09 00:58:09,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 159 flow [2025-03-09 00:58:09,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:58:09,023 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 94 flow [2025-03-09 00:58:09,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-03-09 00:58:09,024 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-03-09 00:58:09,024 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 94 flow [2025-03-09 00:58:09,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:09,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:09,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:09,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:58:09,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 00:58:09,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash 13364460, now seen corresponding path program 1 times [2025-03-09 00:58:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:09,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573432289] [2025-03-09 00:58:09,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:09,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:58:09,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:58:09,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:09,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:58:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573432289] [2025-03-09 00:58:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573432289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298293029] [2025-03-09 00:58:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:09,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:58:09,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:09,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:58:09,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:58:09,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 63 [2025-03-09 00:58:09,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:09,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:09,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 63 [2025-03-09 00:58:09,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:09,354 INFO L124 PetriNetUnfolderBase]: 2714/4053 cut-off events. [2025-03-09 00:58:09,355 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-03-09 00:58:09,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8076 conditions, 4053 events. 2714/4053 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22640 event pairs, 2506 based on Foata normal form. 398/4214 useless extension candidates. Maximal degree in co-relation 8071. Up to 3911 conditions per place. [2025-03-09 00:58:09,375 INFO L140 encePairwiseOnDemand]: 61/63 looper letters, 30 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-03-09 00:58:09,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 150 flow [2025-03-09 00:58:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:58:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:58:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-09 00:58:09,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2025-03-09 00:58:09,378 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 94 flow. Second operand 3 states and 83 transitions. [2025-03-09 00:58:09,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 150 flow [2025-03-09 00:58:09,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:09,381 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 90 flow [2025-03-09 00:58:09,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-03-09 00:58:09,381 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2025-03-09 00:58:09,381 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 90 flow [2025-03-09 00:58:09,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:09,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:09,382 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:09,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:58:09,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 00:58:09,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1338268226, now seen corresponding path program 1 times [2025-03-09 00:58:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497704958] [2025-03-09 00:58:09,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:09,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:58:09,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:58:09,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:09,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:09,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:58:09,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:58:09,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:58:09,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:09,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:09,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:58:09,408 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:58:09,408 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 00:58:09,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-09 00:58:09,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-09 00:58:09,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-09 00:58:09,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-09 00:58:09,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-09 00:58:09,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:58:09,409 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 00:58:09,409 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:58:09,409 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 00:58:09,439 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:58:09,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 90 transitions, 216 flow [2025-03-09 00:58:09,449 INFO L124 PetriNetUnfolderBase]: 6/75 cut-off events. [2025-03-09 00:58:09,449 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 00:58:09,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 75 events. 6/75 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 214 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2025-03-09 00:58:09,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 90 transitions, 216 flow [2025-03-09 00:58:09,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 61 transitions, 143 flow [2025-03-09 00:58:09,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:58:09,451 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;@76f7caa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:58:09,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 00:58:09,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:58:09,453 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-09 00:58:09,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:09,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:09,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:58:09,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 00:58:09,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 350164735, now seen corresponding path program 1 times [2025-03-09 00:58:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-09 00:58:09,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:09,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:58:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:58:09,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:09,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:58:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-09 00:58:09,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772660985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:09,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:09,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150966096] [2025-03-09 00:58:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:09,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:58:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:09,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:58:09,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:58:09,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 90 [2025-03-09 00:58:09,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 143 flow. Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:09,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:09,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 90 [2025-03-09 00:58:09,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:13,354 INFO L124 PetriNetUnfolderBase]: 58806/78312 cut-off events. [2025-03-09 00:58:13,354 INFO L125 PetriNetUnfolderBase]: For 3412/3412 co-relation queries the response was YES. [2025-03-09 00:58:13,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156770 conditions, 78312 events. 58806/78312 cut-off events. For 3412/3412 co-relation queries the response was YES. Maximal size of possible extension queue 2682. Compared 496533 event pairs, 54173 based on Foata normal form. 8783/82011 useless extension candidates. Maximal degree in co-relation 156758. Up to 76375 conditions per place. [2025-03-09 00:58:13,811 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 44 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2025-03-09 00:58:13,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 217 flow [2025-03-09 00:58:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:58:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:58:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2025-03-09 00:58:13,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 00:58:13,813 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 143 flow. Second operand 2 states and 96 transitions. [2025-03-09 00:58:13,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 217 flow [2025-03-09 00:58:13,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 214 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:58:13,818 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 126 flow [2025-03-09 00:58:13,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=126, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2025-03-09 00:58:13,819 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -5 predicate places. [2025-03-09 00:58:13,819 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 126 flow [2025-03-09 00:58:13,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:13,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:13,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:13,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:58:13,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-09 00:58:13,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1225813990, now seen corresponding path program 1 times [2025-03-09 00:58:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:13,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017646306] [2025-03-09 00:58:13,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:13,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:58:13,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:58:13,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:13,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:13,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-03-09 00:58:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017646306] [2025-03-09 00:58:13,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017646306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:13,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:13,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:13,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830034386] [2025-03-09 00:58:13,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:13,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:58:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:13,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:58:13,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:58:13,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 90 [2025-03-09 00:58:13,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:13,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:13,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 90 [2025-03-09 00:58:13,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:16,322 INFO L124 PetriNetUnfolderBase]: 43007/57636 cut-off events. [2025-03-09 00:58:16,322 INFO L125 PetriNetUnfolderBase]: For 1482/1482 co-relation queries the response was YES. [2025-03-09 00:58:16,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115021 conditions, 57636 events. 43007/57636 cut-off events. For 1482/1482 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 356863 event pairs, 39532 based on Foata normal form. 4391/58214 useless extension candidates. Maximal degree in co-relation 115015. Up to 56183 conditions per place. [2025-03-09 00:58:16,651 INFO L140 encePairwiseOnDemand]: 88/90 looper letters, 42 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2025-03-09 00:58:16,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 206 flow [2025-03-09 00:58:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:58:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:58:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-09 00:58:16,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-09 00:58:16,655 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 126 flow. Second operand 3 states and 116 transitions. [2025-03-09 00:58:16,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 206 flow [2025-03-09 00:58:16,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:16,658 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 122 flow [2025-03-09 00:58:16,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2025-03-09 00:58:16,659 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -6 predicate places. [2025-03-09 00:58:16,659 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 122 flow [2025-03-09 00:58:16,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:16,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:16,659 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:16,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:58:16,659 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-03-09 00:58:16,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -547600660, now seen corresponding path program 1 times [2025-03-09 00:58:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:16,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940158113] [2025-03-09 00:58:16,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:16,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:58:16,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:58:16,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:16,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:16,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:58:16,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:58:16,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:58:16,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:16,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:16,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:58:16,690 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:58:16,690 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-09 00:58:16,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-09 00:58:16,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-09 00:58:16,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-09 00:58:16,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-09 00:58:16,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-09 00:58:16,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-09 00:58:16,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:58:16,692 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 00:58:16,692 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:58:16,692 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 00:58:16,729 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:58:16,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 117 transitions, 290 flow [2025-03-09 00:58:16,740 INFO L124 PetriNetUnfolderBase]: 7/93 cut-off events. [2025-03-09 00:58:16,740 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 00:58:16,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 93 events. 7/93 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 291 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 109. Up to 5 conditions per place. [2025-03-09 00:58:16,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 117 transitions, 290 flow [2025-03-09 00:58:16,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 74 transitions, 179 flow [2025-03-09 00:58:16,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:58:16,744 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;@76f7caa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:58:16,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 00:58:16,745 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:58:16,745 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-03-09 00:58:16,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:16,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:16,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:58:16,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-09 00:58:16,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash 462592986, now seen corresponding path program 1 times [2025-03-09 00:58:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572526306] [2025-03-09 00:58:16,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:16,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:16,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:58:16,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:58:16,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:16,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:58:16,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:16,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572526306] [2025-03-09 00:58:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572526306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:16,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:16,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:16,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197422013] [2025-03-09 00:58:16,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:16,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:58:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:16,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:58:16,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:58:16,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 117 [2025-03-09 00:58:16,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 179 flow. Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:16,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:16,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 117 [2025-03-09 00:58:16,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand