./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.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/48_ticket_lock_low_contention_vs-pthread.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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:58:55,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:58:55,707 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:55,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:58:55,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:58:55,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:58:55,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:58:55,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:58:55,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:58:55,734 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:58:55,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:58:55,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:58:55,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:58:55,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:58:55,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:58:55,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:58:55,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:58:55,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:58:55,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:58:55,737 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2025-03-09 00:58:55,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:58:55,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:58:55,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:58:55,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:58:55,969 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:58:55,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-03-09 00:58:57,140 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a776f812/a7b4c884f7e24d089cf683b5d9e74318/FLAG2570c92ae [2025-03-09 00:58:57,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:58:57,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-03-09 00:58:57,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a776f812/a7b4c884f7e24d089cf683b5d9e74318/FLAG2570c92ae [2025-03-09 00:58:57,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a776f812/a7b4c884f7e24d089cf683b5d9e74318 [2025-03-09 00:58:57,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:58:57,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:58:57,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:58:57,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:58:57,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:58:57,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:58:57" (1/1) ... [2025-03-09 00:58:57,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:57, skipping insertion in model container [2025-03-09 00:58:57,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:58:57" (1/1) ... [2025-03-09 00:58:57,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:58:57,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:58:57,760 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:58:57,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:58:57,833 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:58:57,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:57 WrapperNode [2025-03-09 00:58:57,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:58:57,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:58:57,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:58:57,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:58:57,839 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:57" (1/1) ... [2025-03-09 00:58:57,849 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:57" (1/1) ... [2025-03-09 00:58:57,865 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 66 [2025-03-09 00:58:57,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:58:57,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:58:57,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:58:57,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:58:57,872 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:57" (1/1) ... [2025-03-09 00:58:57,872 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:57" (1/1) ... [2025-03-09 00:58:57,874 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:57" (1/1) ... [2025-03-09 00:58:57,888 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:57,889 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:57" (1/1) ... [2025-03-09 00:58:57,889 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:57" (1/1) ... [2025-03-09 00:58:57,896 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:57" (1/1) ... [2025-03-09 00:58:57,897 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:57" (1/1) ... [2025-03-09 00:58:57,898 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:57" (1/1) ... [2025-03-09 00:58:57,898 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:57" (1/1) ... [2025-03-09 00:58:57,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:58:57,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:58:57,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:58:57,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:58:57,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:57" (1/1) ... [2025-03-09 00:58:57,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:58:57,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:58:57,932 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:57,935 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:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-09 00:58:57,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-09 00:58:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:58:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:58:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:58:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:58:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:58:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:58:57,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:58:57,954 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:58,049 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:58:58,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:58:58,173 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:58:58,173 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:58:58,238 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:58:58,238 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:58:58,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:58:58 BoogieIcfgContainer [2025-03-09 00:58:58,239 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:58:58,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:58:58,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:58:58,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:58:58,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:58:57" (1/3) ... [2025-03-09 00:58:58,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed92965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:58:58, skipping insertion in model container [2025-03-09 00:58:58,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:58:57" (2/3) ... [2025-03-09 00:58:58,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed92965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:58:58, skipping insertion in model container [2025-03-09 00:58:58,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:58:58" (3/3) ... [2025-03-09 00:58:58,248 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2025-03-09 00:58:58,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:58:58,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-09 00:58:58,262 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:58:58,301 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:58:58,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 35 transitions, 74 flow [2025-03-09 00:58:58,349 INFO L124 PetriNetUnfolderBase]: 8/54 cut-off events. [2025-03-09 00:58:58,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:58,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 8/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 155 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2025-03-09 00:58:58,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 35 transitions, 74 flow [2025-03-09 00:58:58,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 35 transitions, 74 flow [2025-03-09 00:58:58,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:58:58,372 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;@509ea253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:58:58,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 00:58:58,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:58:58,383 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-03-09 00:58:58,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:58:58,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:58,384 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 00:58:58,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2025-03-09 00:58:58,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash -87610154, now seen corresponding path program 1 times [2025-03-09 00:58:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57080871] [2025-03-09 00:58:58,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:58,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:58,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 00:58:58,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 00:58:58,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:58,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:58,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:58:58,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 00:58:58,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 00:58:58,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:58,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:58,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:58:58,511 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:58:58,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-09 00:58:58,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-09 00:58:58,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-03-09 00:58:58,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-03-09 00:58:58,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-09 00:58:58,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:58:58,514 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-09 00:58:58,519 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:58:58,519 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 00:58:58,535 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:58:58,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 108 flow [2025-03-09 00:58:58,566 INFO L124 PetriNetUnfolderBase]: 13/87 cut-off events. [2025-03-09 00:58:58,567 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:58:58,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 87 events. 13/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 318 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 56. Up to 6 conditions per place. [2025-03-09 00:58:58,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 108 flow [2025-03-09 00:58:58,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 49 transitions, 108 flow [2025-03-09 00:58:58,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:58:58,572 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;@509ea253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:58:58,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 00:58:58,581 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:58:58,582 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-09 00:58:58,582 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:58:58,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:58,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:58,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 00:58:58,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1299082344, now seen corresponding path program 1 times [2025-03-09 00:58:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:58,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528811034] [2025-03-09 00:58:58,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:58,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:58,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:58:58,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:58:58,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:58,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:58:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528811034] [2025-03-09 00:58:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528811034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:58,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:58,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:58,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448910427] [2025-03-09 00:58:58,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:58,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:58:58,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:58,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:58:58,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:58:58,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2025-03-09 00:58:58,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 108 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:58,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:58,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2025-03-09 00:58:58,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:58,908 INFO L124 PetriNetUnfolderBase]: 680/1518 cut-off events. [2025-03-09 00:58:58,909 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 00:58:58,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 1518 events. 680/1518 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10270 event pairs, 680 based on Foata normal form. 354/1781 useless extension candidates. Maximal degree in co-relation 1931. Up to 1154 conditions per place. [2025-03-09 00:58:58,923 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 23 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-03-09 00:58:58,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 134 flow [2025-03-09 00:58:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:58:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:58:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2025-03-09 00:58:58,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2025-03-09 00:58:58,934 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 108 flow. Second operand 2 states and 62 transitions. [2025-03-09 00:58:58,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 134 flow [2025-03-09 00:58:58,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:58,937 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 88 flow [2025-03-09 00:58:58,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-03-09 00:58:58,941 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-03-09 00:58:58,942 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 88 flow [2025-03-09 00:58:58,942 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:58,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:58,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:58,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:58:58,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 00:58:58,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash 903783762, now seen corresponding path program 1 times [2025-03-09 00:58:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:58,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952568272] [2025-03-09 00:58:58,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:58,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:58:58,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:58:58,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:58,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:59,073 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:59,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:59,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952568272] [2025-03-09 00:58:59,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952568272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:59,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:59,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:58:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393914616] [2025-03-09 00:58:59,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:59,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:58:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:59,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:58:59,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:58:59,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2025-03-09 00:58:59,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:59,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:59,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2025-03-09 00:58:59,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:58:59,324 INFO L124 PetriNetUnfolderBase]: 1080/2305 cut-off events. [2025-03-09 00:58:59,326 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 00:58:59,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4151 conditions, 2305 events. 1080/2305 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16306 event pairs, 687 based on Foata normal form. 206/2453 useless extension candidates. Maximal degree in co-relation 4146. Up to 1386 conditions per place. [2025-03-09 00:58:59,337 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 41 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-03-09 00:58:59,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 229 flow [2025-03-09 00:58:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:58:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:58:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-09 00:58:59,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-03-09 00:58:59,340 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 88 flow. Second operand 3 states and 89 transitions. [2025-03-09 00:58:59,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 229 flow [2025-03-09 00:58:59,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:58:59,343 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 142 flow [2025-03-09 00:58:59,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-03-09 00:58:59,345 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-03-09 00:58:59,345 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 142 flow [2025-03-09 00:58:59,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:58:59,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:59,345 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1] [2025-03-09 00:58:59,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:58:59,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 00:58:59,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2075053549, now seen corresponding path program 1 times [2025-03-09 00:58:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214458404] [2025-03-09 00:58:59,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:59,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:58:59,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:58:59,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:59,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:59,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:58:59,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:58:59,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:58:59,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:59,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:58:59,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:58:59,378 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:58:59,378 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 00:58:59,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-09 00:58:59,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-09 00:58:59,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-03-09 00:58:59,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-03-09 00:58:59,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-09 00:58:59,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:58:59,379 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 00:58:59,379 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:58:59,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 00:58:59,396 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:58:59,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 63 transitions, 144 flow [2025-03-09 00:58:59,408 INFO L124 PetriNetUnfolderBase]: 18/120 cut-off events. [2025-03-09 00:58:59,408 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 00:58:59,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 18/120 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 473 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 93. Up to 8 conditions per place. [2025-03-09 00:58:59,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 63 transitions, 144 flow [2025-03-09 00:58:59,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 63 transitions, 144 flow [2025-03-09 00:58:59,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:58:59,411 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;@509ea253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:58:59,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 00:58:59,413 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:58:59,413 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-09 00:58:59,413 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:58:59,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:58:59,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:58:59,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 00:58:59,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:58:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1229266152, now seen corresponding path program 1 times [2025-03-09 00:58:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:58:59,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123317673] [2025-03-09 00:58:59,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:58:59,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:58:59,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:58:59,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:59,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:58:59,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:58:59,438 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:59,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:58:59,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123317673] [2025-03-09 00:58:59,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123317673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:58:59,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:58:59,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:58:59,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928421416] [2025-03-09 00:58:59,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:58:59,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:58:59,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:58:59,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:58:59,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:58:59,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 63 [2025-03-09 00:58:59,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 144 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:59,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:58:59,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 63 [2025-03-09 00:58:59,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:00,212 INFO L124 PetriNetUnfolderBase]: 6440/11500 cut-off events. [2025-03-09 00:59:00,213 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2025-03-09 00:59:00,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20958 conditions, 11500 events. 6440/11500 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 91690 event pairs, 6440 based on Foata normal form. 3066/14060 useless extension candidates. Maximal degree in co-relation 4459. Up to 9290 conditions per place. [2025-03-09 00:59:00,286 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 29 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2025-03-09 00:59:00,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 176 flow [2025-03-09 00:59:00,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:59:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:59:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-03-09 00:59:00,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2025-03-09 00:59:00,290 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 144 flow. Second operand 2 states and 80 transitions. [2025-03-09 00:59:00,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 176 flow [2025-03-09 00:59:00,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 174 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 00:59:00,291 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 116 flow [2025-03-09 00:59:00,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=116, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-03-09 00:59:00,292 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2025-03-09 00:59:00,292 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 116 flow [2025-03-09 00:59:00,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:59:00,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:00,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:00,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:59:00,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 00:59:00,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1226881519, now seen corresponding path program 1 times [2025-03-09 00:59:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:00,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948944698] [2025-03-09 00:59:00,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:00,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:59:00,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:59:00,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:00,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:00,361 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:59:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948944698] [2025-03-09 00:59:00,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948944698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:00,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:59:00,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366622602] [2025-03-09 00:59:00,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:00,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:59:00,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:00,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:59:00,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:59:00,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 63 [2025-03-09 00:59:00,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:59:00,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:00,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 63 [2025-03-09 00:59:00,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:01,692 INFO L124 PetriNetUnfolderBase]: 13477/23792 cut-off events. [2025-03-09 00:59:01,692 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2025-03-09 00:59:01,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43390 conditions, 23792 events. 13477/23792 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 1166. Compared 207058 event pairs, 8161 based on Foata normal form. 2081/25407 useless extension candidates. Maximal degree in co-relation 43384. Up to 14060 conditions per place. [2025-03-09 00:59:01,814 INFO L140 encePairwiseOnDemand]: 51/63 looper letters, 52 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2025-03-09 00:59:01,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 300 flow [2025-03-09 00:59:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:59:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:59:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-09 00:59:01,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6084656084656085 [2025-03-09 00:59:01,819 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 116 flow. Second operand 3 states and 115 transitions. [2025-03-09 00:59:01,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 300 flow [2025-03-09 00:59:01,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 300 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:59:01,821 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 188 flow [2025-03-09 00:59:01,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-03-09 00:59:01,823 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2025-03-09 00:59:01,823 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 188 flow [2025-03-09 00:59:01,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:59:01,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:01,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:01,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:59:01,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 00:59:01,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2082176609, now seen corresponding path program 1 times [2025-03-09 00:59:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6726930] [2025-03-09 00:59:01,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:01,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:59:01,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:59:01,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:01,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:01,873 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:59:01,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:01,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6726930] [2025-03-09 00:59:01,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6726930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:01,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:01,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:59:01,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917136166] [2025-03-09 00:59:01,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:01,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:59:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:01,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:59:01,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:59:01,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 63 [2025-03-09 00:59:01,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:59:01,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:01,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 63 [2025-03-09 00:59:01,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:03,002 INFO L124 PetriNetUnfolderBase]: 10881/20172 cut-off events. [2025-03-09 00:59:03,002 INFO L125 PetriNetUnfolderBase]: For 7378/7528 co-relation queries the response was YES. [2025-03-09 00:59:03,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44689 conditions, 20172 events. 10881/20172 cut-off events. For 7378/7528 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 180751 event pairs, 9371 based on Foata normal form. 127/19604 useless extension candidates. Maximal degree in co-relation 44681. Up to 14599 conditions per place. [2025-03-09 00:59:03,087 INFO L140 encePairwiseOnDemand]: 61/63 looper letters, 32 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2025-03-09 00:59:03,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 252 flow [2025-03-09 00:59:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:59:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:59:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-09 00:59:03,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-09 00:59:03,088 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 188 flow. Second operand 3 states and 90 transitions. [2025-03-09 00:59:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 252 flow [2025-03-09 00:59:03,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:59:03,107 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 172 flow [2025-03-09 00:59:03,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-03-09 00:59:03,109 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2025-03-09 00:59:03,109 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 172 flow [2025-03-09 00:59:03,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:59:03,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:03,110 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2025-03-09 00:59:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:59:03,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-09 00:59:03,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash 217441509, now seen corresponding path program 1 times [2025-03-09 00:59:03,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-03-09 00:59:03,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:03,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:59:03,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:59:03,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:03,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:59:03,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:59:03,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:59:03,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:59:03,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:03,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:59:03,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:59:03,145 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:59:03,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-09 00:59:03,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-09 00:59:03,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-09 00:59:03,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-03-09 00:59:03,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-09 00:59:03,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-09 00:59:03,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-09 00:59:03,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:59:03,146 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 00:59:03,147 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:59:03,147 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 00:59:03,170 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:59:03,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 77 transitions, 182 flow [2025-03-09 00:59:03,180 INFO L124 PetriNetUnfolderBase]: 23/153 cut-off events. [2025-03-09 00:59:03,180 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 00:59:03,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 153 events. 23/153 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 630 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 131. Up to 10 conditions per place. [2025-03-09 00:59:03,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 77 transitions, 182 flow [2025-03-09 00:59:03,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 77 transitions, 182 flow [2025-03-09 00:59:03,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:59:03,184 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;@509ea253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:59:03,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 00:59:03,186 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:59:03,186 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-09 00:59:03,186 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:59:03,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:03,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:03,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1719376280, now seen corresponding path program 1 times [2025-03-09 00:59:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231460050] [2025-03-09 00:59:03,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:03,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:59:03,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:59:03,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:03,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:03,205 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:59:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:03,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231460050] [2025-03-09 00:59:03,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231460050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:03,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:03,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:59:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267841998] [2025-03-09 00:59:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:59:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:03,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:59:03,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:59:03,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 77 [2025-03-09 00:59:03,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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:59:03,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:03,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 77 [2025-03-09 00:59:03,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:06,780 INFO L124 PetriNetUnfolderBase]: 52880/83516 cut-off events. [2025-03-09 00:59:06,780 INFO L125 PetriNetUnfolderBase]: For 3018/3018 co-relation queries the response was YES. [2025-03-09 00:59:06,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154751 conditions, 83516 events. 52880/83516 cut-off events. For 3018/3018 co-relation queries the response was YES. Maximal size of possible extension queue 3411. Compared 736329 event pairs, 52880 based on Foata normal form. 24138/104740 useless extension candidates. Maximal degree in co-relation 21051. Up to 69986 conditions per place. [2025-03-09 00:59:07,443 INFO L140 encePairwiseOnDemand]: 66/77 looper letters, 35 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2025-03-09 00:59:07,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 61 transitions, 220 flow [2025-03-09 00:59:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:59:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:59:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2025-03-09 00:59:07,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-09 00:59:07,444 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 182 flow. Second operand 2 states and 98 transitions. [2025-03-09 00:59:07,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 61 transitions, 220 flow [2025-03-09 00:59:07,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 61 transitions, 214 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 00:59:07,447 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 144 flow [2025-03-09 00:59:07,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-03-09 00:59:07,447 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -4 predicate places. [2025-03-09 00:59:07,447 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 144 flow [2025-03-09 00:59:07,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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:59:07,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:07,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:07,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:59:07,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:07,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash -13279266, now seen corresponding path program 1 times [2025-03-09 00:59:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418337586] [2025-03-09 00:59:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:07,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:07,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:59:07,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:59:07,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:07,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:07,503 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:59:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:07,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418337586] [2025-03-09 00:59:07,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418337586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:07,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:59:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159353126] [2025-03-09 00:59:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:07,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:59:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:07,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:59:07,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:59:07,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 77 [2025-03-09 00:59:07,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-03-09 00:59:07,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:07,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 77 [2025-03-09 00:59:07,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:17,305 INFO L124 PetriNetUnfolderBase]: 141969/224643 cut-off events. [2025-03-09 00:59:17,305 INFO L125 PetriNetUnfolderBase]: For 2050/2050 co-relation queries the response was YES. [2025-03-09 00:59:17,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414328 conditions, 224643 events. 141969/224643 cut-off events. For 2050/2050 co-relation queries the response was YES. Maximal size of possible extension queue 8533. Compared 2191905 event pairs, 82899 based on Foata normal form. 19479/240410 useless extension candidates. Maximal degree in co-relation 414321. Up to 130411 conditions per place. [2025-03-09 00:59:18,688 INFO L140 encePairwiseOnDemand]: 62/77 looper letters, 63 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2025-03-09 00:59:18,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 94 transitions, 371 flow [2025-03-09 00:59:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:59:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:59:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-03-09 00:59:18,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6103896103896104 [2025-03-09 00:59:18,689 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 144 flow. Second operand 3 states and 141 transitions. [2025-03-09 00:59:18,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 94 transitions, 371 flow [2025-03-09 00:59:18,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 94 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:59:18,693 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 234 flow [2025-03-09 00:59:18,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-03-09 00:59:18,694 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2025-03-09 00:59:18,694 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 234 flow [2025-03-09 00:59:18,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-03-09 00:59:18,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:18,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:18,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:59:18,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash 122839694, now seen corresponding path program 1 times [2025-03-09 00:59:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:18,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432615407] [2025-03-09 00:59:18,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:18,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:59:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:59:18,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:18,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:18,721 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:59:18,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432615407] [2025-03-09 00:59:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432615407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:59:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554730533] [2025-03-09 00:59:18,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:18,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:59:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:18,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:59:18,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:59:18,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2025-03-09 00:59:18,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:59:18,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:18,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2025-03-09 00:59:18,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:59:28,204 INFO L124 PetriNetUnfolderBase]: 117405/192139 cut-off events. [2025-03-09 00:59:28,204 INFO L125 PetriNetUnfolderBase]: For 69658/70744 co-relation queries the response was YES. [2025-03-09 00:59:28,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432668 conditions, 192139 events. 117405/192139 cut-off events. For 69658/70744 co-relation queries the response was YES. Maximal size of possible extension queue 7800. Compared 1937521 event pairs, 99665 based on Foata normal form. 783/187295 useless extension candidates. Maximal degree in co-relation 432659. Up to 142201 conditions per place. [2025-03-09 00:59:29,580 INFO L140 encePairwiseOnDemand]: 75/77 looper letters, 39 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-03-09 00:59:29,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 70 transitions, 312 flow [2025-03-09 00:59:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:59:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:59:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-09 00:59:29,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-03-09 00:59:29,582 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 234 flow. Second operand 3 states and 111 transitions. [2025-03-09 00:59:29,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 70 transitions, 312 flow [2025-03-09 00:59:29,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:59:29,707 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 214 flow [2025-03-09 00:59:29,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2025-03-09 00:59:29,708 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2025-03-09 00:59:29,708 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 214 flow [2025-03-09 00:59:29,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:59:29,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:29,708 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:59:29,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 00:59:29,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash -675695546, now seen corresponding path program 1 times [2025-03-09 00:59:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017194477] [2025-03-09 00:59:29,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:29,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:59:29,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:59:29,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:29,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:59:29,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:59:29,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 00:59:29,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 00:59:29,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:29,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:59:29,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:59:29,736 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:59:29,736 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-09 00:59:29,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-09 00:59:29,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-03-09 00:59:29,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-03-09 00:59:29,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-09 00:59:29,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-03-09 00:59:29,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-03-09 00:59:29,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-09 00:59:29,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:59:29,737 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 00:59:29,737 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:59:29,737 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-09 00:59:29,757 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:59:29,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 222 flow [2025-03-09 00:59:29,773 INFO L124 PetriNetUnfolderBase]: 28/186 cut-off events. [2025-03-09 00:59:29,773 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 00:59:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 186 events. 28/186 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 801 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 170. Up to 12 conditions per place. [2025-03-09 00:59:29,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 91 transitions, 222 flow [2025-03-09 00:59:29,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 91 transitions, 222 flow [2025-03-09 00:59:29,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:59:29,777 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;@509ea253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:59:29,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-09 00:59:29,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:59:29,780 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-09 00:59:29,780 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:59:29,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:59:29,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:59:29,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-09 00:59:29,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:59:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1043089640, now seen corresponding path program 1 times [2025-03-09 00:59:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:59:29,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521402764] [2025-03-09 00:59:29,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:59:29,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:59:29,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:59:29,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:59:29,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:59:29,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:59:29,791 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:59:29,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:59:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521402764] [2025-03-09 00:59:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521402764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:59:29,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:59:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:59:29,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552668632] [2025-03-09 00:59:29,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:59:29,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:59:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:59:29,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:59:29,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:59:29,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 91 [2025-03-09 00:59:29,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 222 flow. Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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:59:29,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:59:29,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 91 [2025-03-09 00:59:29,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand