./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/03_incdec.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/03_incdec.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7242322569cf2f27ee72f2a65e0d58ced23407c575f0c8898b19424239a034d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:35:47,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:35:47,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:35:47,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:35:47,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:35:47,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:35:47,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:35:47,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:35:47,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:35:47,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:35:47,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:35:47,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:35:47,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:35:47,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:35:47,780 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:35:47,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:35:47,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:35:47,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:35:47,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:47,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:35:47,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:35:47,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:35:47,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:35:47,783 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7242322569cf2f27ee72f2a65e0d58ced23407c575f0c8898b19424239a034d [2025-02-06 12:35:48,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:35:48,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:35:48,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:35:48,105 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:35:48,105 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:35:48,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/03_incdec.i [2025-02-06 12:35:49,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dbc436e3/5d65d4dab14146d294f639dab8276956/FLAG25caf538b [2025-02-06 12:35:49,749 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:35:49,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/03_incdec.i [2025-02-06 12:35:49,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dbc436e3/5d65d4dab14146d294f639dab8276956/FLAG25caf538b [2025-02-06 12:35:49,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dbc436e3/5d65d4dab14146d294f639dab8276956 [2025-02-06 12:35:49,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:35:49,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:35:49,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:49,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:35:49,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:35:49,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:49" (1/1) ... [2025-02-06 12:35:49,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da31256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:49, skipping insertion in model container [2025-02-06 12:35:49,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:49" (1/1) ... [2025-02-06 12:35:49,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:35:50,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:50,143 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:35:50,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:50,234 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:35:50,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50 WrapperNode [2025-02-06 12:35:50,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:50,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:50,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:35:50,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:35:50,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,281 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2025-02-06 12:35:50,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:50,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:35:50,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:35:50,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:35:50,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,301 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-02-06 12:35:50,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:35:50,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:35:50,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:35:50,316 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:35:50,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (1/1) ... [2025-02-06 12:35:50,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:50,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:50,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:35:50,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:35:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:35:50,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:35:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:35:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:35:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:35:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:35:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:35:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:35:50,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:35:50,376 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:35:50,490 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:35:50,492 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:35:50,678 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:35:50,679 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:35:50,782 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:35:50,782 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:35:50,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:50 BoogieIcfgContainer [2025-02-06 12:35:50,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:35:50,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:35:50,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:35:50,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:35:50,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:35:49" (1/3) ... [2025-02-06 12:35:50,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e02bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:50, skipping insertion in model container [2025-02-06 12:35:50,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:50" (2/3) ... [2025-02-06 12:35:50,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e02bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:50, skipping insertion in model container [2025-02-06 12:35:50,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:50" (3/3) ... [2025-02-06 12:35:50,798 INFO L128 eAbstractionObserver]: Analyzing ICFG 03_incdec.i [2025-02-06 12:35:50,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:35:50,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 03_incdec.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-02-06 12:35:50,813 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:35:50,877 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:35:50,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 52 transitions, 108 flow [2025-02-06 12:35:50,944 INFO L124 PetriNetUnfolderBase]: 7/56 cut-off events. [2025-02-06 12:35:50,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:50,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 56 events. 7/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 127 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-02-06 12:35:50,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 52 transitions, 108 flow [2025-02-06 12:35:50,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 52 transitions, 108 flow [2025-02-06 12:35:50,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:50,976 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;@1e7cd401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:50,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:35:50,982 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:50,983 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:35:50,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:50,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:50,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:35:50,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:35:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash 265266, now seen corresponding path program 1 times [2025-02-06 12:35:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537443200] [2025-02-06 12:35:50,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:51,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:35:51,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:35:51,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:51,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:51,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537443200] [2025-02-06 12:35:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537443200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:51,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:51,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82196031] [2025-02-06 12:35:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:51,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:35:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:51,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:35:51,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:35:51,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 52 [2025-02-06 12:35:51,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:51,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:51,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 52 [2025-02-06 12:35:51,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:51,289 INFO L124 PetriNetUnfolderBase]: 51/163 cut-off events. [2025-02-06 12:35:51,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:51,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 163 events. 51/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 639 event pairs, 42 based on Foata normal form. 12/172 useless extension candidates. Maximal degree in co-relation 274. Up to 120 conditions per place. [2025-02-06 12:35:51,293 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 28 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2025-02-06 12:35:51,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 146 flow [2025-02-06 12:35:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:35:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:35:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2025-02-06 12:35:51,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-06 12:35:51,307 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 108 flow. Second operand 2 states and 65 transitions. [2025-02-06 12:35:51,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 146 flow [2025-02-06 12:35:51,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:35:51,312 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 90 flow [2025-02-06 12:35:51,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-02-06 12:35:51,316 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-02-06 12:35:51,317 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 90 flow [2025-02-06 12:35:51,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:51,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:51,317 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 12:35:51,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:35:51,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 12:35:51,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash -684646612, now seen corresponding path program 1 times [2025-02-06 12:35:51,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:51,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660756741] [2025-02-06 12:35:51,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:51,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:35:51,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:35:51,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:51,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:51,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:35:51,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:35:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:35:51,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:51,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:35:51,379 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:35:51,381 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 12:35:51,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:35:51,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:35:51,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-02-06 12:35:51,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-06 12:35:51,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:35:51,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:35:51,384 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:35:51,388 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:35:51,388 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:35:51,442 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:35:51,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 97 transitions, 204 flow [2025-02-06 12:35:51,475 INFO L124 PetriNetUnfolderBase]: 14/106 cut-off events. [2025-02-06 12:35:51,475 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:35:51,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 106 events. 14/106 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 382 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 93. Up to 3 conditions per place. [2025-02-06 12:35:51,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 97 transitions, 204 flow [2025-02-06 12:35:51,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 97 transitions, 204 flow [2025-02-06 12:35:51,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:51,479 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;@1e7cd401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:51,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:35:51,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:51,481 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:35:51,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:51,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:51,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:35:51,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:35:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 361587, now seen corresponding path program 1 times [2025-02-06 12:35:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:51,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929401331] [2025-02-06 12:35:51,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:51,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:35:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:35:51,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:51,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:51,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929401331] [2025-02-06 12:35:51,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929401331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:51,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:51,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:51,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805500333] [2025-02-06 12:35:51,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:51,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:35:51,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:51,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:35:51,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:35:51,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-02-06 12:35:51,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 97 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:51,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:51,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-02-06 12:35:51,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:52,140 INFO L124 PetriNetUnfolderBase]: 2757/5385 cut-off events. [2025-02-06 12:35:52,140 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-06 12:35:52,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 5385 events. 2757/5385 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 41051 event pairs, 2352 based on Foata normal form. 510/5646 useless extension candidates. Maximal degree in co-relation 4508. Up to 4278 conditions per place. [2025-02-06 12:35:52,210 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 53 selfloop transitions, 0 changer transitions 0/82 dead transitions. [2025-02-06 12:35:52,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 82 transitions, 280 flow [2025-02-06 12:35:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:35:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:35:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2025-02-06 12:35:52,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6288659793814433 [2025-02-06 12:35:52,212 INFO L175 Difference]: Start difference. First operand has 88 places, 97 transitions, 204 flow. Second operand 2 states and 122 transitions. [2025-02-06 12:35:52,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 82 transitions, 280 flow [2025-02-06 12:35:52,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:35:52,215 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 174 flow [2025-02-06 12:35:52,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=174, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2025-02-06 12:35:52,216 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -6 predicate places. [2025-02-06 12:35:52,216 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 174 flow [2025-02-06 12:35:52,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:52,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:52,216 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-06 12:35:52,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:35:52,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 12:35:52,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1972106930, now seen corresponding path program 1 times [2025-02-06 12:35:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:52,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724813903] [2025-02-06 12:35:52,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:52,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:35:52,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:35:52,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:52,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:52,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:35:52,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:35:52,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:35:52,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:52,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:52,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:35:52,254 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:35:52,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 12:35:52,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-02-06 12:35:52,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-02-06 12:35:52,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-02-06 12:35:52,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-02-06 12:35:52,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-02-06 12:35:52,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-02-06 12:35:52,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-06 12:35:52,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:35:52,255 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:35:52,255 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:35:52,255 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:35:52,310 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:35:52,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 142 transitions, 302 flow [2025-02-06 12:35:52,330 INFO L124 PetriNetUnfolderBase]: 21/156 cut-off events. [2025-02-06 12:35:52,330 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:35:52,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 21/156 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 684 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 137. Up to 4 conditions per place. [2025-02-06 12:35:52,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 142 transitions, 302 flow [2025-02-06 12:35:52,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 142 transitions, 302 flow [2025-02-06 12:35:52,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:52,339 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;@1e7cd401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:52,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 12:35:52,340 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:52,340 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:35:52,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:52,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:52,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:35:52,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 12:35:52,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 502593, now seen corresponding path program 1 times [2025-02-06 12:35:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401021844] [2025-02-06 12:35:52,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:52,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:35:52,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:35:52,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:52,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:52,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401021844] [2025-02-06 12:35:52,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401021844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:52,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:52,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852727762] [2025-02-06 12:35:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:52,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:35:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:52,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:35:52,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:35:52,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 142 [2025-02-06 12:35:52,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 142 transitions, 302 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:52,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:52,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 142 [2025-02-06 12:35:52,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:00,752 INFO L124 PetriNetUnfolderBase]: 97137/154845 cut-off events. [2025-02-06 12:36:00,752 INFO L125 PetriNetUnfolderBase]: For 3074/3074 co-relation queries the response was YES. [2025-02-06 12:36:01,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287455 conditions, 154845 events. 97137/154845 cut-off events. For 3074/3074 co-relation queries the response was YES. Maximal size of possible extension queue 6429. Compared 1479602 event pairs, 83664 based on Foata normal form. 17154/164472 useless extension candidates. Maximal degree in co-relation 29836. Up to 130602 conditions per place. [2025-02-06 12:36:01,849 INFO L140 encePairwiseOnDemand]: 129/142 looper letters, 78 selfloop transitions, 0 changer transitions 0/121 dead transitions. [2025-02-06 12:36:01,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 121 transitions, 416 flow [2025-02-06 12:36:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:36:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:36:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 179 transitions. [2025-02-06 12:36:01,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6302816901408451 [2025-02-06 12:36:01,851 INFO L175 Difference]: Start difference. First operand has 128 places, 142 transitions, 302 flow. Second operand 2 states and 179 transitions. [2025-02-06 12:36:01,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 121 transitions, 416 flow [2025-02-06 12:36:01,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 414 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:01,856 INFO L231 Difference]: Finished difference. Result has 120 places, 121 transitions, 258 flow [2025-02-06 12:36:01,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=258, PETRI_PLACES=120, PETRI_TRANSITIONS=121} [2025-02-06 12:36:01,858 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -8 predicate places. [2025-02-06 12:36:01,859 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 121 transitions, 258 flow [2025-02-06 12:36:01,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:01,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:01,859 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-06 12:36:01,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:36:01,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-02-06 12:36:01,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1441017301, now seen corresponding path program 1 times [2025-02-06 12:36:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:01,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098134595] [2025-02-06 12:36:01,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:01,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:01,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:36:01,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:36:01,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:01,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:01,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:01,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:36:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:36:01,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:01,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:01,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:01,907 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:01,907 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 12:36:01,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2025-02-06 12:36:01,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 10 remaining) [2025-02-06 12:36:01,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-02-06 12:36:01,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (5 of 10 remaining) [2025-02-06 12:36:01,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 10 remaining) [2025-02-06 12:36:01,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-02-06 12:36:01,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2025-02-06 12:36:01,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2025-02-06 12:36:01,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-02-06 12:36:01,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:36:01,912 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:36:01,913 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:36:01,913 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:36:01,959 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:01,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 187 transitions, 402 flow [2025-02-06 12:36:01,977 INFO L124 PetriNetUnfolderBase]: 28/206 cut-off events. [2025-02-06 12:36:01,977 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:36:01,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 206 events. 28/206 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 966 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 181. Up to 5 conditions per place. [2025-02-06 12:36:01,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 187 transitions, 402 flow [2025-02-06 12:36:01,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 187 transitions, 402 flow [2025-02-06 12:36:01,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:01,982 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;@1e7cd401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:01,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 12:36:01,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:01,984 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:36:01,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:01,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:01,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:01,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-02-06 12:36:01,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash 688284, now seen corresponding path program 1 times [2025-02-06 12:36:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:01,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777574566] [2025-02-06 12:36:01,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:01,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:01,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:02,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:02,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:02,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777574566] [2025-02-06 12:36:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777574566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:36:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815837688] [2025-02-06 12:36:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:02,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:36:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:02,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:36:02,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:36:02,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 187 [2025-02-06 12:36:02,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 187 transitions, 402 flow. Second operand has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:02,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:02,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 187 [2025-02-06 12:36:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand