./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.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-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:53:53,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:53:53,414 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:53:53,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:53:53,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:53:53,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:53:53,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:53:53,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:53:53,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:53:53,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:53:53,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:53:53,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:53:53,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:53:53,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:53:53,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:53:53,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:53:53,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:53:53,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:53:53,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:53:53,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:53:53,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:53:53,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:53:53,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:53:53,443 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-02-06 12:53:53,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:53:53,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:53:53,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:53:53,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:53:53,659 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:53:53,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-02-06 12:53:54,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a81aa118/a6c5f689f8c241efb1df0ee66cb6291c/FLAGf340a80f3 [2025-02-06 12:53:55,232 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:53:55,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-02-06 12:53:55,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a81aa118/a6c5f689f8c241efb1df0ee66cb6291c/FLAGf340a80f3 [2025-02-06 12:53:55,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a81aa118/a6c5f689f8c241efb1df0ee66cb6291c [2025-02-06 12:53:55,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:53:55,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:53:55,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:53:55,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:53:55,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:53:55,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:53:55" (1/1) ... [2025-02-06 12:53:55,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344e6249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:55, skipping insertion in model container [2025-02-06 12:53:55,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:53:55" (1/1) ... [2025-02-06 12:53:55,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:53:55,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:53:55,899 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:53:55,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:53:56,000 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:53:56,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56 WrapperNode [2025-02-06 12:53:56,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:53:56,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:53:56,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:53:56,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:53:56,006 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:53:56" (1/1) ... [2025-02-06 12:53:56,020 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:53:56" (1/1) ... [2025-02-06 12:53:56,036 INFO L138 Inliner]: procedures = 364, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2025-02-06 12:53:56,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:53:56,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:53:56,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:53:56,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:53:56,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:53:56,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:53:56,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:53:56,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:53:56,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:53:56,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (1/1) ... [2025-02-06 12:53:56,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:53:56,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:53:56,100 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:53:56,104 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:53:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:53:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:53:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-02-06 12:53:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-02-06 12:53:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:53:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:53:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:53:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:53:56,122 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:53:56,242 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:53:56,243 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:53:56,420 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:53:56,421 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:53:56,562 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:53:56,562 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:53:56,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:53:56 BoogieIcfgContainer [2025-02-06 12:53:56,563 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:53:56,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:53:56,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:53:56,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:53:56,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:53:55" (1/3) ... [2025-02-06 12:53:56,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd25c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:53:56, skipping insertion in model container [2025-02-06 12:53:56,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:56" (2/3) ... [2025-02-06 12:53:56,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd25c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:53:56, skipping insertion in model container [2025-02-06 12:53:56,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:53:56" (3/3) ... [2025-02-06 12:53:56,568 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-02-06 12:53:56,578 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:53:56,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 12:53:56,579 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:53:56,617 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 12:53:56,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2025-02-06 12:53:56,664 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-02-06 12:53:56,665 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:53:56,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-02-06 12:53:56,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2025-02-06 12:53:56,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2025-02-06 12:53:56,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:53:56,691 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;@3525fcbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:53:56,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 12:53:56,698 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:53:56,698 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-02-06 12:53:56,699 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:53:56,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:53:56,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:53:56,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:53:56,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:53:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1174437618, now seen corresponding path program 1 times [2025-02-06 12:53:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:53:56,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027419128] [2025-02-06 12:53:56,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:53:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:53:56,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:53:56,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:53:56,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:53:56,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:56,961 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:53:56,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:53:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027419128] [2025-02-06 12:53:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027419128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:53:56,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:53:56,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:53:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247163149] [2025-02-06 12:53:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:53:56,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:53:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:53:56,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:53:56,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:53:56,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-02-06 12:53:56,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:53:56,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:53:56,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-02-06 12:53:56,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:53:57,063 INFO L124 PetriNetUnfolderBase]: 37/90 cut-off events. [2025-02-06 12:53:57,064 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:53:57,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 90 events. 37/90 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 270 event pairs, 15 based on Foata normal form. 9/98 useless extension candidates. Maximal degree in co-relation 154. Up to 54 conditions per place. [2025-02-06 12:53:57,066 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 21 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2025-02-06 12:53:57,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 108 flow [2025-02-06 12:53:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:53:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:53:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-02-06 12:53:57,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-02-06 12:53:57,076 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 3 states and 48 transitions. [2025-02-06 12:53:57,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 28 transitions, 108 flow [2025-02-06 12:53:57,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:53:57,082 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2025-02-06 12:53:57,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-02-06 12:53:57,086 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2025-02-06 12:53:57,086 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2025-02-06 12:53:57,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:53:57,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:53:57,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:53:57,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:53:57,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:53:57,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:53:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash -355367348, now seen corresponding path program 1 times [2025-02-06 12:53:57,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:53:57,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364374129] [2025-02-06 12:53:57,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:53:57,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:53:57,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:53:57,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:53:57,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:53:57,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:53:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:53:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364374129] [2025-02-06 12:53:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364374129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:53:57,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:53:57,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:53:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793815557] [2025-02-06 12:53:57,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:53:57,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:53:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:53:57,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:53:57,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:53:57,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 12:53:57,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:53:57,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:53:57,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 12:53:57,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:53:57,258 INFO L124 PetriNetUnfolderBase]: 51/122 cut-off events. [2025-02-06 12:53:57,258 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-06 12:53:57,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 122 events. 51/122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 387 event pairs, 20 based on Foata normal form. 5/126 useless extension candidates. Maximal degree in co-relation 50. Up to 66 conditions per place. [2025-02-06 12:53:57,259 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 21 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-02-06 12:53:57,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 122 flow [2025-02-06 12:53:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:53:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:53:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-06 12:53:57,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2025-02-06 12:53:57,261 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 46 transitions. [2025-02-06 12:53:57,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 28 transitions, 122 flow [2025-02-06 12:53:57,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:53:57,264 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 62 flow [2025-02-06 12:53:57,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2025-02-06 12:53:57,264 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2025-02-06 12:53:57,265 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 62 flow [2025-02-06 12:53:57,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:53:57,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:53:57,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:53:57,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:53:57,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:53:57,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:53:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1297348398, now seen corresponding path program 1 times [2025-02-06 12:53:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:53:57,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053177671] [2025-02-06 12:53:57,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:53:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:53:57,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:53:57,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:53:57,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:53:57,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:53:57,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:53:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053177671] [2025-02-06 12:53:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053177671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:53:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93958570] [2025-02-06 12:53:57,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:53:57,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:53:57,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:53:57,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:53:57,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:53:57,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:53:57,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:53:57,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:53:57,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:57,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:53:57,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:53:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:53:57,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:53:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:53:57,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93958570] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:53:57,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:53:57,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:53:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841745249] [2025-02-06 12:53:57,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:53:57,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:53:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:53:57,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:53:57,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:53:57,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-02-06 12:53:57,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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:53:57,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:53:57,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-02-06 12:53:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:53:57,675 INFO L124 PetriNetUnfolderBase]: 116/242 cut-off events. [2025-02-06 12:53:57,675 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-06 12:53:57,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 242 events. 116/242 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 714 event pairs, 8 based on Foata normal form. 15/257 useless extension candidates. Maximal degree in co-relation 153. Up to 69 conditions per place. [2025-02-06 12:53:57,676 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 42 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2025-02-06 12:53:57,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 52 transitions, 248 flow [2025-02-06 12:53:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:53:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:53:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-02-06 12:53:57,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-02-06 12:53:57,678 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 62 flow. Second operand 6 states and 88 transitions. [2025-02-06 12:53:57,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 52 transitions, 248 flow [2025-02-06 12:53:57,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 52 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:53:57,679 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 100 flow [2025-02-06 12:53:57,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-02-06 12:53:57,679 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-02-06 12:53:57,680 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 100 flow [2025-02-06 12:53:57,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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:53:57,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:53:57,680 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:53:57,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:53:57,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:53:57,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:53:57,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:53:57,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1882497408, now seen corresponding path program 2 times [2025-02-06 12:53:57,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:53:57,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972374913] [2025-02-06 12:53:57,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:53:57,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:53:57,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 12:53:57,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 34 statements. [2025-02-06 12:53:57,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:53:57,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 12:53:57,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:53:57,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972374913] [2025-02-06 12:53:57,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972374913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:53:57,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:53:57,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:53:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038009994] [2025-02-06 12:53:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:53:57,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:53:57,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:53:57,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:53:57,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:53:57,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-02-06 12:53:57,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:53:57,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:53:57,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-02-06 12:53:57,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:53:58,053 INFO L124 PetriNetUnfolderBase]: 149/360 cut-off events. [2025-02-06 12:53:58,054 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-02-06 12:53:58,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 360 events. 149/360 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1406 event pairs, 54 based on Foata normal form. 19/378 useless extension candidates. Maximal degree in co-relation 581. Up to 154 conditions per place. [2025-02-06 12:53:58,059 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 37 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2025-02-06 12:53:58,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 296 flow [2025-02-06 12:53:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:53:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:53:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-06 12:53:58,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-06 12:53:58,061 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 100 flow. Second operand 4 states and 60 transitions. [2025-02-06 12:53:58,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 296 flow [2025-02-06 12:53:58,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 272 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-02-06 12:53:58,063 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 108 flow [2025-02-06 12:53:58,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2025-02-06 12:53:58,064 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2025-02-06 12:53:58,064 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 108 flow [2025-02-06 12:53:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:53:58,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:53:58,064 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:53:58,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:53:58,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:53:58,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:53:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash -721249388, now seen corresponding path program 3 times [2025-02-06 12:53:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:53:58,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053042552] [2025-02-06 12:53:58,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:53:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:53:58,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-02-06 12:53:58,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 12:53:58,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 12:53:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 12:53:58,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:53:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053042552] [2025-02-06 12:53:58,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053042552] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:53:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822842116] [2025-02-06 12:53:58,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:53:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:53:58,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:53:58,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:53:58,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:53:58,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-02-06 12:53:58,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 12:53:58,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 12:53:58,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:58,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:53:58,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:53:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 12:53:58,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:53:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 12:53:58,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822842116] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:53:58,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:53:58,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 12:53:58,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187384181] [2025-02-06 12:53:58,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:53:58,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:53:58,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:53:58,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:53:58,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:53:58,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-02-06 12:53:58,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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:53:58,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:53:58,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-02-06 12:53:58,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:53:58,539 INFO L124 PetriNetUnfolderBase]: 382/796 cut-off events. [2025-02-06 12:53:58,539 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2025-02-06 12:53:58,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 796 events. 382/796 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3524 event pairs, 36 based on Foata normal form. 76/872 useless extension candidates. Maximal degree in co-relation 1414. Up to 134 conditions per place. [2025-02-06 12:53:58,544 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 81 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-02-06 12:53:58,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 93 transitions, 602 flow [2025-02-06 12:53:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:53:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:53:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2025-02-06 12:53:58,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-06 12:53:58,545 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 108 flow. Second operand 8 states and 120 transitions. [2025-02-06 12:53:58,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 93 transitions, 602 flow [2025-02-06 12:53:58,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 93 transitions, 596 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:53:58,548 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 160 flow [2025-02-06 12:53:58,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=160, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2025-02-06 12:53:58,549 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2025-02-06 12:53:58,549 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 160 flow [2025-02-06 12:53:58,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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:53:58,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:53:58,549 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:53:58,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:53:58,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:53:58,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:53:58,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:53:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1074117292, now seen corresponding path program 4 times [2025-02-06 12:53:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:53:58,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995910198] [2025-02-06 12:53:58,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:53:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:53:58,770 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-06 12:53:58,781 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 12:53:58,781 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:53:58,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 12:53:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:53:58,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995910198] [2025-02-06 12:53:58,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995910198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:53:58,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018455012] [2025-02-06 12:53:58,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:53:58,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:53:58,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:53:58,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:53:58,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:53:58,961 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-06 12:53:58,978 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 12:53:58,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:53:58,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:53:58,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 12:53:58,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:53:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 12:53:59,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:53:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 12:53:59,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018455012] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:53:59,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:53:59,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-06 12:53:59,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179286785] [2025-02-06 12:53:59,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:53:59,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:53:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:53:59,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:53:59,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:53:59,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-02-06 12:53:59,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 160 flow. Second operand has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 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:53:59,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:53:59,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-02-06 12:53:59,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:53:59,467 INFO L124 PetriNetUnfolderBase]: 816/1693 cut-off events. [2025-02-06 12:53:59,469 INFO L125 PetriNetUnfolderBase]: For 3436/3436 co-relation queries the response was YES. [2025-02-06 12:53:59,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 1693 events. 816/1693 cut-off events. For 3436/3436 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7813 event pairs, 49 based on Foata normal form. 152/1845 useless extension candidates. Maximal degree in co-relation 3665. Up to 304 conditions per place. [2025-02-06 12:53:59,482 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 169 selfloop transitions, 16 changer transitions 0/189 dead transitions. [2025-02-06 12:53:59,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 189 transitions, 1348 flow [2025-02-06 12:53:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:53:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 12:53:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 244 transitions. [2025-02-06 12:53:59,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-02-06 12:53:59,485 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 160 flow. Second operand 16 states and 244 transitions. [2025-02-06 12:53:59,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 189 transitions, 1348 flow [2025-02-06 12:53:59,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 189 transitions, 1296 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-02-06 12:53:59,497 INFO L231 Difference]: Finished difference. Result has 67 places, 38 transitions, 264 flow [2025-02-06 12:53:59,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=264, PETRI_PLACES=67, PETRI_TRANSITIONS=38} [2025-02-06 12:53:59,498 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 42 predicate places. [2025-02-06 12:53:59,498 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 38 transitions, 264 flow [2025-02-06 12:53:59,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 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:53:59,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:53:59,498 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:53:59,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:53:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:53:59,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:53:59,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:53:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1801584286, now seen corresponding path program 5 times [2025-02-06 12:53:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:53:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121749470] [2025-02-06 12:53:59,700 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:53:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:53:59,713 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 73 statements into 14 equivalence classes. [2025-02-06 12:53:59,732 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 12:53:59,733 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-06 12:53:59,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 12:54:00,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121749470] [2025-02-06 12:54:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121749470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716396048] [2025-02-06 12:54:00,010 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:54:00,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:00,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:00,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:00,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:54:00,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 73 statements into 14 equivalence classes. [2025-02-06 12:54:00,103 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 12:54:00,103 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-06 12:54:00,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:00,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:54:00,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-06 12:54:00,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-02-06 12:54:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716396048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:00,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:00,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 27 [2025-02-06 12:54:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614576978] [2025-02-06 12:54:00,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:00,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 12:54:00,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:00,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 12:54:00,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=501, Unknown=0, NotChecked=0, Total=702 [2025-02-06 12:54:00,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-02-06 12:54:00,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 38 transitions, 264 flow. Second operand has 27 states, 27 states have (on average 9.666666666666666) internal successors, (261), 27 states have internal predecessors, (261), 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:54:00,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:00,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-02-06 12:54:00,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:04,815 INFO L124 PetriNetUnfolderBase]: 1803/3733 cut-off events. [2025-02-06 12:54:04,815 INFO L125 PetriNetUnfolderBase]: For 19601/19601 co-relation queries the response was YES. [2025-02-06 12:54:04,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13170 conditions, 3733 events. 1803/3733 cut-off events. For 19601/19601 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20743 event pairs, 6 based on Foata normal form. 257/3990 useless extension candidates. Maximal degree in co-relation 9569. Up to 901 conditions per place. [2025-02-06 12:54:04,839 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 859 selfloop transitions, 368 changer transitions 0/1232 dead transitions. [2025-02-06 12:54:04,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1232 transitions, 8016 flow [2025-02-06 12:54:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2025-02-06 12:54:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2025-02-06 12:54:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 2396 transitions. [2025-02-06 12:54:04,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5013601171793263 [2025-02-06 12:54:04,849 INFO L175 Difference]: Start difference. First operand has 67 places, 38 transitions, 264 flow. Second operand 177 states and 2396 transitions. [2025-02-06 12:54:04,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1232 transitions, 8016 flow [2025-02-06 12:54:04,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 1232 transitions, 7906 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 12:54:04,877 INFO L231 Difference]: Finished difference. Result has 354 places, 397 transitions, 4376 flow [2025-02-06 12:54:04,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=177, PETRI_FLOW=4376, PETRI_PLACES=354, PETRI_TRANSITIONS=397} [2025-02-06 12:54:04,880 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 329 predicate places. [2025-02-06 12:54:04,881 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 397 transitions, 4376 flow [2025-02-06 12:54:04,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.666666666666666) internal successors, (261), 27 states have internal predecessors, (261), 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:54:04,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:04,882 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:04,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:54:05,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 12:54:05,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:05,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -239289816, now seen corresponding path program 6 times [2025-02-06 12:54:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:05,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348589904] [2025-02-06 12:54:05,084 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 12:54:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:05,098 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 16 equivalence classes. [2025-02-06 12:54:05,127 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 12:54:05,127 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-02-06 12:54:05,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 12:54:05,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:05,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348589904] [2025-02-06 12:54:05,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348589904] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:05,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600461036] [2025-02-06 12:54:05,425 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 12:54:05,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:05,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:05,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:54:05,500 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 16 equivalence classes. [2025-02-06 12:54:05,561 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 12:54:05,562 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-02-06 12:54:05,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:05,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 12:54:05,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 12:54:05,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 12:54:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600461036] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:05,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:05,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 23 [2025-02-06 12:54:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285157209] [2025-02-06 12:54:05,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:05,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 12:54:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:05,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 12:54:05,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:54:05,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-02-06 12:54:05,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 397 transitions, 4376 flow. Second operand has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 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:54:05,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:05,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-02-06 12:54:05,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:07,367 INFO L124 PetriNetUnfolderBase]: 2675/5956 cut-off events. [2025-02-06 12:54:07,367 INFO L125 PetriNetUnfolderBase]: For 461254/461254 co-relation queries the response was YES. [2025-02-06 12:54:07,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35583 conditions, 5956 events. 2675/5956 cut-off events. For 461254/461254 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 33801 event pairs, 464 based on Foata normal form. 245/6201 useless extension candidates. Maximal degree in co-relation 33100. Up to 946 conditions per place. [2025-02-06 12:54:07,462 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 361 selfloop transitions, 232 changer transitions 0/613 dead transitions. [2025-02-06 12:54:07,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 613 transitions, 10934 flow [2025-02-06 12:54:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 12:54:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 12:54:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 331 transitions. [2025-02-06 12:54:07,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572390572390572 [2025-02-06 12:54:07,467 INFO L175 Difference]: Start difference. First operand has 354 places, 397 transitions, 4376 flow. Second operand 22 states and 331 transitions. [2025-02-06 12:54:07,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 613 transitions, 10934 flow [2025-02-06 12:54:08,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 613 transitions, 10522 flow, removed 0 selfloop flow, removed 16 redundant places. [2025-02-06 12:54:08,568 INFO L231 Difference]: Finished difference. Result has 365 places, 442 transitions, 5142 flow [2025-02-06 12:54:08,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3994, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5142, PETRI_PLACES=365, PETRI_TRANSITIONS=442} [2025-02-06 12:54:08,569 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 340 predicate places. [2025-02-06 12:54:08,569 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 442 transitions, 5142 flow [2025-02-06 12:54:08,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 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:54:08,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:08,569 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:08,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 12:54:08,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:08,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:08,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1621474060, now seen corresponding path program 7 times [2025-02-06 12:54:08,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:08,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927543143] [2025-02-06 12:54:08,773 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 12:54:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:08,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 12:54:08,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 12:54:08,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:08,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 12:54:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:09,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927543143] [2025-02-06 12:54:09,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927543143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:09,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465274176] [2025-02-06 12:54:09,013 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 12:54:09,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:09,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:09,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:09,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:54:09,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 12:54:09,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 12:54:09,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:09,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:09,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 12:54:09,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 12:54:09,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-06 12:54:09,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465274176] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:09,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:09,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-02-06 12:54:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161869851] [2025-02-06 12:54:09,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:09,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 12:54:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:09,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 12:54:09,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:54:09,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-02-06 12:54:09,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 442 transitions, 5142 flow. Second operand has 23 states, 23 states have (on average 12.043478260869565) internal successors, (277), 23 states have internal predecessors, (277), 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:54:09,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:09,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-02-06 12:54:09,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:11,870 INFO L124 PetriNetUnfolderBase]: 4233/8684 cut-off events. [2025-02-06 12:54:11,870 INFO L125 PetriNetUnfolderBase]: For 2347352/2347456 co-relation queries the response was YES. [2025-02-06 12:54:11,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44637 conditions, 8684 events. 4233/8684 cut-off events. For 2347352/2347456 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 54509 event pairs, 179 based on Foata normal form. 424/9101 useless extension candidates. Maximal degree in co-relation 42222. Up to 2163 conditions per place. [2025-02-06 12:54:11,968 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 908 selfloop transitions, 352 changer transitions 0/1267 dead transitions. [2025-02-06 12:54:11,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1267 transitions, 17018 flow [2025-02-06 12:54:11,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 12:54:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 12:54:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 335 transitions. [2025-02-06 12:54:11,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563973063973064 [2025-02-06 12:54:11,972 INFO L175 Difference]: Start difference. First operand has 365 places, 442 transitions, 5142 flow. Second operand 22 states and 335 transitions. [2025-02-06 12:54:11,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1267 transitions, 17018 flow [2025-02-06 12:54:13,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 1267 transitions, 16088 flow, removed 0 selfloop flow, removed 15 redundant places. [2025-02-06 12:54:13,618 INFO L231 Difference]: Finished difference. Result has 382 places, 618 transitions, 7712 flow [2025-02-06 12:54:13,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=4812, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7712, PETRI_PLACES=382, PETRI_TRANSITIONS=618} [2025-02-06 12:54:13,619 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 357 predicate places. [2025-02-06 12:54:13,619 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 618 transitions, 7712 flow [2025-02-06 12:54:13,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.043478260869565) internal successors, (277), 23 states have internal predecessors, (277), 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:54:13,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:13,619 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:13,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:54:13,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 12:54:13,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:13,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1448092848, now seen corresponding path program 8 times [2025-02-06 12:54:13,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:13,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915418236] [2025-02-06 12:54:13,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:13,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-02-06 12:54:13,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 12:54:13,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:54:13,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:54:13,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:54:13,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 12:54:13,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 12:54:13,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:13,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:54:14,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:54:14,002 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:54:14,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2025-02-06 12:54:14,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2025-02-06 12:54:14,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-06 12:54:14,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:54:14,005 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2025-02-06 12:54:14,133 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:54:14,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:54:14,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:54:14 BasicIcfg [2025-02-06 12:54:14,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:54:14,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:54:14,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:54:14,139 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:54:14,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:53:56" (3/4) ... [2025-02-06 12:54:14,141 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:54:14,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:54:14,142 INFO L158 Benchmark]: Toolchain (without parser) took 18639.36ms. Allocated memory was 201.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 158.0MB in the beginning and 509.5MB in the end (delta: -351.5MB). Peak memory consumption was 712.7MB. Max. memory is 16.1GB. [2025-02-06 12:54:14,142 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:54:14,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.88ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 120.6MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 12:54:14,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.56ms. Allocated memory is still 201.3MB. Free memory was 120.6MB in the beginning and 118.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:54:14,143 INFO L158 Benchmark]: Boogie Preprocessor took 32.75ms. Allocated memory is still 201.3MB. Free memory was 118.4MB in the beginning and 116.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:54:14,143 INFO L158 Benchmark]: IcfgBuilder took 491.89ms. Allocated memory is still 201.3MB. Free memory was 116.4MB in the beginning and 74.3MB in the end (delta: 42.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 12:54:14,143 INFO L158 Benchmark]: TraceAbstraction took 17573.99ms. Allocated memory was 201.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 73.8MB in the beginning and 509.6MB in the end (delta: -435.8MB). Peak memory consumption was 628.8MB. Max. memory is 16.1GB. [2025-02-06 12:54:14,143 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 1.3GB. Free memory was 509.6MB in the beginning and 509.5MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:54:14,144 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.88ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 120.6MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.56ms. Allocated memory is still 201.3MB. Free memory was 120.6MB in the beginning and 118.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.75ms. Allocated memory is still 201.3MB. Free memory was 118.4MB in the beginning and 116.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 491.89ms. Allocated memory is still 201.3MB. Free memory was 116.4MB in the beginning and 74.3MB in the end (delta: 42.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17573.99ms. Allocated memory was 201.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 73.8MB in the beginning and 509.6MB in the end (delta: -435.8MB). Peak memory consumption was 628.8MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 1.3GB. Free memory was 509.6MB in the beginning and 509.5MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=20, myglobal=20] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=21, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=23, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=25, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=27, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=29, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=31, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=32, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=33, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=34, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=35, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=36, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=37, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=38, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=39, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=40, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) [L13] CALL 0 reach_error() [L12] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=20, myglobal=40] [L12] 0 __assert_fail ("0", "pthread-demo-datarace-2.c", 25, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=20, myglobal=40] - UnprovableResult [Line: 1338]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 32 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.4s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2693 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2675 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1436 IncrementalHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 4 mSDtfsCounter, 1436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1174 GetRequests, 913 SyntacticMatches, 14 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11650 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7712occurred in iteration=9, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 1253 ConstructedInterpolants, 0 QuantifiedInterpolants, 3043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1313 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 3183/5501 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:54:14,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-C-DAC/pthread-demo-datarace-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:54:16,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:54:16,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:54:16,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:54:16,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:54:16,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:54:16,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:54:16,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:54:16,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:54:16,344 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:54:16,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:54:16,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:54:16,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:54:16,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:54:16,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:54:16,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:54:16,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:54:16,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:54:16,346 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-02-06 12:54:16,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:54:16,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:54:16,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:54:16,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:54:16,610 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:54:16,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-02-06 12:54:17,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d00db91a/641ca04abc2d4c8685bf10f3d721e67e/FLAG6d99f1aeb [2025-02-06 12:54:18,058 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:54:18,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-02-06 12:54:18,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d00db91a/641ca04abc2d4c8685bf10f3d721e67e/FLAG6d99f1aeb [2025-02-06 12:54:18,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d00db91a/641ca04abc2d4c8685bf10f3d721e67e [2025-02-06 12:54:18,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:54:18,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:54:18,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:54:18,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:54:18,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:54:18,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294e3aca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18, skipping insertion in model container [2025-02-06 12:54:18,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:54:18,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:54:18,619 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:54:18,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:54:18,731 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:54:18,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18 WrapperNode [2025-02-06 12:54:18,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:54:18,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:54:18,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:54:18,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:54:18,738 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:54:18" (1/1) ... [2025-02-06 12:54:18,764 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:54:18" (1/1) ... [2025-02-06 12:54:18,785 INFO L138 Inliner]: procedures = 365, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2025-02-06 12:54:18,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:54:18,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:54:18,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:54:18,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:54:18,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,814 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:54:18,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:54:18,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:54:18,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:54:18,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:54:18,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (1/1) ... [2025-02-06 12:54:18,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:54:18,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:18,863 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:54:18,882 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:54:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:54:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:54:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:54:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-02-06 12:54:18,902 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-02-06 12:54:18,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:54:18,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:54:18,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:54:18,902 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:54:19,015 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:54:19,017 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:54:19,189 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:54:19,190 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:54:19,442 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:54:19,442 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:54:19,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:19 BoogieIcfgContainer [2025-02-06 12:54:19,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:54:19,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:54:19,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:54:19,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:54:19,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:54:18" (1/3) ... [2025-02-06 12:54:19,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1848eab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:54:19, skipping insertion in model container [2025-02-06 12:54:19,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:18" (2/3) ... [2025-02-06 12:54:19,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1848eab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:54:19, skipping insertion in model container [2025-02-06 12:54:19,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:19" (3/3) ... [2025-02-06 12:54:19,451 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-02-06 12:54:19,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:54:19,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 12:54:19,467 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:54:19,509 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 12:54:19,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2025-02-06 12:54:19,554 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-02-06 12:54:19,558 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:54:19,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-02-06 12:54:19,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2025-02-06 12:54:19,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2025-02-06 12:54:19,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:54:19,586 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;@1d8dca18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:54:19,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 12:54:19,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:54:19,594 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-02-06 12:54:19,594 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:54:19,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:19,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:19,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:19,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:19,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1107606092, now seen corresponding path program 1 times [2025-02-06 12:54:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737069155] [2025-02-06 12:54:19,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:19,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:19,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:19,613 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:19,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:54:19,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:54:19,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:54:19,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:19,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:19,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 12:54:19,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:19,735 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:54:19,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:54:19,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:19,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737069155] [2025-02-06 12:54:19,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737069155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:19,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:19,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:19,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218227772] [2025-02-06 12:54:19,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:19,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:54:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:19,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:54:19,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:54:19,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 12:54:19,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:19,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:19,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 12:54:19,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:19,807 INFO L124 PetriNetUnfolderBase]: 19/51 cut-off events. [2025-02-06 12:54:19,808 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-06 12:54:19,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 51 events. 19/51 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 10 based on Foata normal form. 3/49 useless extension candidates. Maximal degree in co-relation 79. Up to 42 conditions per place. [2025-02-06 12:54:19,810 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 14 selfloop transitions, 0 changer transitions 1/20 dead transitions. [2025-02-06 12:54:19,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 74 flow [2025-02-06 12:54:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:54:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:54:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2025-02-06 12:54:19,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-06 12:54:19,822 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 2 states and 33 transitions. [2025-02-06 12:54:19,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 74 flow [2025-02-06 12:54:19,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:19,827 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 40 flow [2025-02-06 12:54:19,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-02-06 12:54:19,831 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -4 predicate places. [2025-02-06 12:54:19,831 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 40 flow [2025-02-06 12:54:19,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:19,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:19,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:19,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:54:20,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:20,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:20,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash -18580490, now seen corresponding path program 1 times [2025-02-06 12:54:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:20,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330663994] [2025-02-06 12:54:20,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:20,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:20,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:54:20,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:54:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:54:20,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:20,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:20,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:54:20,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:20,142 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:54:20,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:54:20,142 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330663994] [2025-02-06 12:54:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330663994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:20,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359100120] [2025-02-06 12:54:20,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:20,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:20,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:20,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 12:54:20,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:54:20,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:20,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 12:54:20,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:20,194 INFO L124 PetriNetUnfolderBase]: 31/77 cut-off events. [2025-02-06 12:54:20,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:20,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 77 events. 31/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 182 event pairs, 8 based on Foata normal form. 3/76 useless extension candidates. Maximal degree in co-relation 143. Up to 42 conditions per place. [2025-02-06 12:54:20,195 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 19 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-02-06 12:54:20,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 26 transitions, 96 flow [2025-02-06 12:54:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-06 12:54:20,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2025-02-06 12:54:20,196 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 40 flow. Second operand 3 states and 46 transitions. [2025-02-06 12:54:20,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 26 transitions, 96 flow [2025-02-06 12:54:20,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:54:20,197 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2025-02-06 12:54:20,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-02-06 12:54:20,198 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2025-02-06 12:54:20,198 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2025-02-06 12:54:20,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:54:20,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:20,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:20,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:54:20,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:20,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:20,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:20,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2073559442, now seen corresponding path program 1 times [2025-02-06 12:54:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:20,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48205035] [2025-02-06 12:54:20,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:20,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:20,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:20,405 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:20,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:54:20,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:54:20,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:54:20,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:20,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:20,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:54:20,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:54:20,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:54:20,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:20,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48205035] [2025-02-06 12:54:20,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48205035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:20,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:20,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110798732] [2025-02-06 12:54:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:20,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:20,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:20,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:20,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-02-06 12:54:20,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:20,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:20,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-02-06 12:54:20,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:20,560 INFO L124 PetriNetUnfolderBase]: 61/145 cut-off events. [2025-02-06 12:54:20,560 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 12:54:20,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 145 events. 61/145 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 499 event pairs, 27 based on Foata normal form. 10/155 useless extension candidates. Maximal degree in co-relation 301. Up to 86 conditions per place. [2025-02-06 12:54:20,562 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-02-06 12:54:20,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 29 transitions, 130 flow [2025-02-06 12:54:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-02-06 12:54:20,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-06 12:54:20,564 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 45 transitions. [2025-02-06 12:54:20,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 29 transitions, 130 flow [2025-02-06 12:54:20,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 29 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:20,565 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 62 flow [2025-02-06 12:54:20,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-02-06 12:54:20,566 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-02-06 12:54:20,566 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 62 flow [2025-02-06 12:54:20,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:20,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:20,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:20,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:54:20,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:20,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:20,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1889253514, now seen corresponding path program 1 times [2025-02-06 12:54:20,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:20,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816116101] [2025-02-06 12:54:20,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:20,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:20,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:20,769 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:20,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:54:20,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:54:20,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:54:20,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:20,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:20,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:54:20,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:20,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:20,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816116101] [2025-02-06 12:54:20,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816116101] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:20,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:54:20,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-06 12:54:20,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518647935] [2025-02-06 12:54:20,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:20,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:54:20,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:20,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:54:20,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:54:20,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-02-06 12:54:20,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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:54:20,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:20,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-02-06 12:54:20,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:21,012 INFO L124 PetriNetUnfolderBase]: 151/310 cut-off events. [2025-02-06 12:54:21,012 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-02-06 12:54:21,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 310 events. 151/310 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1090 event pairs, 18 based on Foata normal form. 30/340 useless extension candidates. Maximal degree in co-relation 746. Up to 70 conditions per place. [2025-02-06 12:54:21,015 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 49 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-02-06 12:54:21,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 58 transitions, 282 flow [2025-02-06 12:54:21,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:54:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:54:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-02-06 12:54:21,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493827160493827 [2025-02-06 12:54:21,016 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 62 flow. Second operand 6 states and 89 transitions. [2025-02-06 12:54:21,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 58 transitions, 282 flow [2025-02-06 12:54:21,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 58 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:21,018 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 100 flow [2025-02-06 12:54:21,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2025-02-06 12:54:21,018 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2025-02-06 12:54:21,019 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 100 flow [2025-02-06 12:54:21,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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:54:21,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:21,019 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:21,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:54:21,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:21,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:21,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash 925827200, now seen corresponding path program 2 times [2025-02-06 12:54:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874606230] [2025-02-06 12:54:21,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:21,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:21,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:21,229 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:21,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:54:21,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 12:54:21,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 28 statements. [2025-02-06 12:54:21,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:54:21,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:21,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:54:21,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 12:54:21,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:54:21,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874606230] [2025-02-06 12:54:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874606230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:54:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173226453] [2025-02-06 12:54:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:21,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:54:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:21,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:54:21,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:54:21,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-02-06 12:54:21,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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-02-06 12:54:21,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:21,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-02-06 12:54:21,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:21,453 INFO L124 PetriNetUnfolderBase]: 135/329 cut-off events. [2025-02-06 12:54:21,453 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-02-06 12:54:21,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 329 events. 135/329 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1304 event pairs, 45 based on Foata normal form. 10/339 useless extension candidates. Maximal degree in co-relation 917. Up to 121 conditions per place. [2025-02-06 12:54:21,458 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 34 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-02-06 12:54:21,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 270 flow [2025-02-06 12:54:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:54:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:54:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-06 12:54:21,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-02-06 12:54:21,461 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 100 flow. Second operand 4 states and 61 transitions. [2025-02-06 12:54:21,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 270 flow [2025-02-06 12:54:21,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 246 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:21,463 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 108 flow [2025-02-06 12:54:21,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2025-02-06 12:54:21,464 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2025-02-06 12:54:21,464 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 108 flow [2025-02-06 12:54:21,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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-02-06 12:54:21,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:21,464 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:21,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 12:54:21,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:21,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:21,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1035702042, now seen corresponding path program 3 times [2025-02-06 12:54:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749866092] [2025-02-06 12:54:21,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:54:21,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:21,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:21,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:21,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:54:21,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-02-06 12:54:21,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 33 statements. [2025-02-06 12:54:21,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:54:21,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:21,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:54:21,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 12:54:21,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 12:54:21,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:21,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749866092] [2025-02-06 12:54:21,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749866092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:21,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:54:21,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-06 12:54:21,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589417386] [2025-02-06 12:54:21,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:21,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:54:21,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:21,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:54:21,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:54:21,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-02-06 12:54:21,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 108 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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:54:21,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:21,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-02-06 12:54:21,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:22,059 INFO L124 PetriNetUnfolderBase]: 300/645 cut-off events. [2025-02-06 12:54:22,059 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-02-06 12:54:22,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1808 conditions, 645 events. 300/645 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2665 event pairs, 18 based on Foata normal form. 40/685 useless extension candidates. Maximal degree in co-relation 1797. Up to 165 conditions per place. [2025-02-06 12:54:22,063 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 72 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2025-02-06 12:54:22,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 520 flow [2025-02-06 12:54:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:54:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:54:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2025-02-06 12:54:22,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5509259259259259 [2025-02-06 12:54:22,065 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 108 flow. Second operand 8 states and 119 transitions. [2025-02-06 12:54:22,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 520 flow [2025-02-06 12:54:22,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 85 transitions, 514 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:22,068 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 160 flow [2025-02-06 12:54:22,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2025-02-06 12:54:22,069 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 21 predicate places. [2025-02-06 12:54:22,070 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 160 flow [2025-02-06 12:54:22,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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:54:22,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:22,071 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:22,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:54:22,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:22,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:22,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1882609890, now seen corresponding path program 4 times [2025-02-06 12:54:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321415007] [2025-02-06 12:54:22,276 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:54:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:22,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:22,278 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:22,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:54:22,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-02-06 12:54:22,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:54:22,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:54:22,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:22,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:54:22,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-06 12:54:22,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-06 12:54:22,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:22,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321415007] [2025-02-06 12:54:22,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321415007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:22,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:54:22,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-02-06 12:54:22,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62844400] [2025-02-06 12:54:22,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:22,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:54:22,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:22,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:54:22,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:54:22,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-02-06 12:54:22,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 160 flow. Second operand has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 12 states have internal predecessors, (116), 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:54:22,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:22,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-02-06 12:54:22,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:23,085 INFO L124 PetriNetUnfolderBase]: 864/1788 cut-off events. [2025-02-06 12:54:23,085 INFO L125 PetriNetUnfolderBase]: For 3497/3497 co-relation queries the response was YES. [2025-02-06 12:54:23,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5773 conditions, 1788 events. 864/1788 cut-off events. For 3497/3497 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8609 event pairs, 71 based on Foata normal form. 162/1950 useless extension candidates. Maximal degree in co-relation 5758. Up to 324 conditions per place. [2025-02-06 12:54:23,100 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 147 selfloop transitions, 12 changer transitions 0/163 dead transitions. [2025-02-06 12:54:23,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 163 transitions, 1400 flow [2025-02-06 12:54:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:54:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:54:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2025-02-06 12:54:23,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5617283950617284 [2025-02-06 12:54:23,102 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 160 flow. Second operand 12 states and 182 transitions. [2025-02-06 12:54:23,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 163 transitions, 1400 flow [2025-02-06 12:54:23,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 163 transitions, 1180 flow, removed 88 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:23,112 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 236 flow [2025-02-06 12:54:23,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=236, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2025-02-06 12:54:23,113 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 37 predicate places. [2025-02-06 12:54:23,114 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 236 flow [2025-02-06 12:54:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 12 states have internal predecessors, (116), 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:54:23,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:23,114 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:23,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:54:23,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:23,315 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:23,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -839310626, now seen corresponding path program 5 times [2025-02-06 12:54:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:23,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256461456] [2025-02-06 12:54:23,316 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:54:23,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:23,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:23,319 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:23,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:54:23,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 71 statements into 11 equivalence classes. [2025-02-06 12:54:23,424 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 12:54:23,424 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 12:54:23,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:23,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:54:23,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-02-06 12:54:23,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-02-06 12:54:24,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:24,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256461456] [2025-02-06 12:54:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256461456] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:24,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:54:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2025-02-06 12:54:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427173277] [2025-02-06 12:54:24,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:24,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 12:54:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:24,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 12:54:24,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 12:54:24,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-02-06 12:54:24,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 36 transitions, 236 flow. Second operand has 34 states, 34 states have (on average 9.058823529411764) internal successors, (308), 34 states have internal predecessors, (308), 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:54:24,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:24,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-02-06 12:54:24,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:34,440 INFO L124 PetriNetUnfolderBase]: 16388/41264 cut-off events. [2025-02-06 12:54:34,440 INFO L125 PetriNetUnfolderBase]: For 127278/127278 co-relation queries the response was YES. [2025-02-06 12:54:34,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156297 conditions, 41264 events. 16388/41264 cut-off events. For 127278/127278 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 457176 event pairs, 282 based on Foata normal form. 37/41300 useless extension candidates. Maximal degree in co-relation 156275. Up to 9322 conditions per place. [2025-02-06 12:54:34,888 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 1446 selfloop transitions, 528 changer transitions 74/2056 dead transitions. [2025-02-06 12:54:34,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 2056 transitions, 17171 flow [2025-02-06 12:54:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2025-02-06 12:54:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2025-02-06 12:54:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 2548 transitions. [2025-02-06 12:54:34,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4472529401439354 [2025-02-06 12:54:34,901 INFO L175 Difference]: Start difference. First operand has 62 places, 36 transitions, 236 flow. Second operand 211 states and 2548 transitions. [2025-02-06 12:54:34,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 2056 transitions, 17171 flow [2025-02-06 12:54:35,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 2056 transitions, 16915 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:54:35,724 INFO L231 Difference]: Finished difference. Result has 343 places, 603 transitions, 2993 flow [2025-02-06 12:54:35,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=211, PETRI_FLOW=2993, PETRI_PLACES=343, PETRI_TRANSITIONS=603} [2025-02-06 12:54:35,725 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 318 predicate places. [2025-02-06 12:54:35,725 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 603 transitions, 2993 flow [2025-02-06 12:54:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 9.058823529411764) internal successors, (308), 34 states have internal predecessors, (308), 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:54:35,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:35,726 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:35,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:54:35,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:35,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 12:54:35,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash -103192192, now seen corresponding path program 6 times [2025-02-06 12:54:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:54:35,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582072208] [2025-02-06 12:54:35,928 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 12:54:35,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:35,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:35,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:35,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:54:36,008 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 71 statements into 4 equivalence classes. [2025-02-06 12:54:36,052 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 12:54:36,053 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 12:54:36,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:36,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 12:54:36,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:54:36,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:54:37,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:54:37,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582072208] [2025-02-06 12:54:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582072208] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:37,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:54:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2025-02-06 12:54:37,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310441912] [2025-02-06 12:54:37,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:37,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-06 12:54:37,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:54:37,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-06 12:54:37,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2230, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 12:54:37,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-02-06 12:54:37,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 603 transitions, 2993 flow. Second operand has 52 states, 52 states have (on average 9.0) internal successors, (468), 52 states have internal predecessors, (468), 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:54:37,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:37,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-02-06 12:54:37,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand