./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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-theta/unwind1-100.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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:46:46,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:46:46,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:46:46,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:46:46,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:46:46,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:46:46,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:46:46,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:46:46,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:46:46,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:46:46,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:46:46,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:46:46,406 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:46:46,407 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:46:46,407 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:46:46,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:46:46,407 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:46:46,407 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:46:46,407 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:46:46,407 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:46:46,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:46:46,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:46:46,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:46:46,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:46:46,408 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-02-08 08:46:46,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:46:46,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:46:46,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:46:46,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:46:46,643 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:46:46,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-02-08 08:46:47,855 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cd5742c2/c3438d3578404e87bf8575128fc41ee6/FLAGbd699e6d7 [2025-02-08 08:46:48,176 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:46:48,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-02-08 08:46:48,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cd5742c2/c3438d3578404e87bf8575128fc41ee6/FLAGbd699e6d7 [2025-02-08 08:46:48,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cd5742c2/c3438d3578404e87bf8575128fc41ee6 [2025-02-08 08:46:48,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:46:48,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:46:48,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:46:48,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:46:48,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:46:48,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5ea10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48, skipping insertion in model container [2025-02-08 08:46:48,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:46:48,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:46:48,528 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:46:48,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:46:48,589 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:46:48,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48 WrapperNode [2025-02-08 08:46:48,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:46:48,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:46:48,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:46:48,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:46:48,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,612 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 53 [2025-02-08 08:46:48,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:46:48,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:46:48,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:46:48,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:46:48,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,625 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-08 08:46:48,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:46:48,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:46:48,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:46:48,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:46:48,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (1/1) ... [2025-02-08 08:46:48,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:46:48,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:48,660 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-08 08:46:48,665 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-08 08:46:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:46:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-08 08:46:48,681 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-08 08:46:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-08 08:46:48,681 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-08 08:46:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:46:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:46:48,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:46:48,682 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:46:48,778 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:46:48,779 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:46:48,871 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:46:48,872 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:46:48,939 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:46:48,939 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:46:48,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:46:48 BoogieIcfgContainer [2025-02-08 08:46:48,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:46:48,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:46:48,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:46:48,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:46:48,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:46:48" (1/3) ... [2025-02-08 08:46:48,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c944d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:46:48, skipping insertion in model container [2025-02-08 08:46:48,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:46:48" (2/3) ... [2025-02-08 08:46:48,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c944d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:46:48, skipping insertion in model container [2025-02-08 08:46:48,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:46:48" (3/3) ... [2025-02-08 08:46:48,947 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-02-08 08:46:48,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:46:48,958 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-08 08:46:48,958 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:46:49,015 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:46:49,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2025-02-08 08:46:49,061 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-02-08 08:46:49,062 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:46:49,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 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/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-02-08 08:46:49,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2025-02-08 08:46:49,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-02-08 08:46:49,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:46:49,081 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;@5543403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:46:49,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 08:46:49,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:46:49,091 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-02-08 08:46:49,091 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:46:49,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:49,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:49,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:49,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2061330347, now seen corresponding path program 1 times [2025-02-08 08:46:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:49,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517269543] [2025-02-08 08:46:49,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:49,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:46:49,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:46:49,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:49,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:49,459 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-08 08:46:49,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:49,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517269543] [2025-02-08 08:46:49,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517269543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:49,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:49,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:46:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683934555] [2025-02-08 08:46:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:49,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:46:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:49,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:46:49,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:46:49,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:46:49,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08 08:46:49,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:49,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:46:49,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:49,717 INFO L124 PetriNetUnfolderBase]: 203/376 cut-off events. [2025-02-08 08:46:49,717 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 08:46:49,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 376 events. 203/376 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1421 event pairs, 83 based on Foata normal form. 26/341 useless extension candidates. Maximal degree in co-relation 684. Up to 187 conditions per place. [2025-02-08 08:46:49,723 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2025-02-08 08:46:49,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 224 flow [2025-02-08 08:46:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:46:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:46:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-02-08 08:46:49,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:46:49,736 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 6 states and 87 transitions. [2025-02-08 08:46:49,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 224 flow [2025-02-08 08:46:49,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:46:49,743 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 91 flow [2025-02-08 08:46:49,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-02-08 08:46:49,749 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2025-02-08 08:46:49,750 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 91 flow [2025-02-08 08:46:49,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08 08:46:49,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:49,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:49,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:46:49,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash -524254582, now seen corresponding path program 1 times [2025-02-08 08:46:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:49,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557350766] [2025-02-08 08:46:49,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:49,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:46:49,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:46:49,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:49,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:49,935 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-08 08:46:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557350766] [2025-02-08 08:46:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557350766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235054851] [2025-02-08 08:46:49,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:49,939 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-08 08:46:49,940 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-08 08:46:49,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:46:49,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:46:49,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:49,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:49,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:46:50,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:50,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:46:50,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235054851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:50,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:46:50,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-08 08:46:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068484118] [2025-02-08 08:46:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:50,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:50,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:50,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:50,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:46:50,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-08 08:46:50,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-08 08:46:50,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:50,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-08 08:46:50,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:50,144 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2025-02-08 08:46:50,144 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-02-08 08:46:50,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 247 events. 111/247 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 949 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 312. Up to 97 conditions per place. [2025-02-08 08:46:50,147 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-02-08 08:46:50,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 228 flow [2025-02-08 08:46:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:46:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:46:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-02-08 08:46:50,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-02-08 08:46:50,148 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 91 flow. Second operand 5 states and 73 transitions. [2025-02-08 08:46:50,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 228 flow [2025-02-08 08:46:50,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:46:50,151 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 127 flow [2025-02-08 08:46:50,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-08 08:46:50,152 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2025-02-08 08:46:50,152 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 127 flow [2025-02-08 08:46:50,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-08 08:46:50,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:50,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:50,159 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-08 08:46:50,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:50,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:50,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2003139732, now seen corresponding path program 1 times [2025-02-08 08:46:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983429641] [2025-02-08 08:46:50,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:50,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:46:50,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:46:50,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:50,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:50,446 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-08 08:46:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983429641] [2025-02-08 08:46:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983429641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388710361] [2025-02-08 08:46:50,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:50,450 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-08 08:46:50,452 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-08 08:46:50,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:46:50,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:46:50,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:50,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:50,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:46:50,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:50,591 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-08 08:46:50,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:46:50,645 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-08 08:46:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388710361] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:46:50,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:46:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 08:46:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625456524] [2025-02-08 08:46:50,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:46:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:46:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:50,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:46:50,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:46:50,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:46:50,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 127 flow. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-08 08:46:50,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:50,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:46:50,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:50,963 INFO L124 PetriNetUnfolderBase]: 140/279 cut-off events. [2025-02-08 08:46:50,963 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-02-08 08:46:50,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 279 events. 140/279 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 898 event pairs, 21 based on Foata normal form. 5/267 useless extension candidates. Maximal degree in co-relation 458. Up to 65 conditions per place. [2025-02-08 08:46:50,966 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 48 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2025-02-08 08:46:50,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 376 flow [2025-02-08 08:46:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:46:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 08:46:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2025-02-08 08:46:50,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3952254641909814 [2025-02-08 08:46:50,968 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 127 flow. Second operand 13 states and 149 transitions. [2025-02-08 08:46:50,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 376 flow [2025-02-08 08:46:50,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:46:50,970 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 212 flow [2025-02-08 08:46:50,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2025-02-08 08:46:50,971 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2025-02-08 08:46:50,971 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 212 flow [2025-02-08 08:46:50,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-08 08:46:50,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:50,971 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:50,978 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-08 08:46:51,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:51,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:51,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2055824201, now seen corresponding path program 2 times [2025-02-08 08:46:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618336418] [2025-02-08 08:46:51,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:46:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:51,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 08:46:51,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:46:51,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:46:51,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:51,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618336418] [2025-02-08 08:46:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618336418] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446374724] [2025-02-08 08:46:51,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:46:51,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:51,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:51,311 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-08 08:46:51,312 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-08 08:46:51,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 08:46:51,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:46:51,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:46:51,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:51,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 08:46:51,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:51,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:46:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:51,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446374724] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:46:51,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:46:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 08:46:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89337256] [2025-02-08 08:46:51,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:46:51,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 08:46:51,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:51,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 08:46:51,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2025-02-08 08:46:51,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:46:51,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 212 flow. Second operand has 21 states, 21 states have (on average 7.619047619047619) internal successors, (160), 21 states have internal predecessors, (160), 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-08 08:46:51,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:51,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:46:51,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:51,965 INFO L124 PetriNetUnfolderBase]: 260/537 cut-off events. [2025-02-08 08:46:51,965 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2025-02-08 08:46:51,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 537 events. 260/537 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2114 event pairs, 40 based on Foata normal form. 30/555 useless extension candidates. Maximal degree in co-relation 1375. Up to 104 conditions per place. [2025-02-08 08:46:51,969 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 93 selfloop transitions, 31 changer transitions 0/128 dead transitions. [2025-02-08 08:46:51,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 799 flow [2025-02-08 08:46:51,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 08:46:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 08:46:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 253 transitions. [2025-02-08 08:46:51,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4154351395730706 [2025-02-08 08:46:51,973 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 212 flow. Second operand 21 states and 253 transitions. [2025-02-08 08:46:51,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 799 flow [2025-02-08 08:46:51,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 128 transitions, 713 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-02-08 08:46:51,982 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 379 flow [2025-02-08 08:46:51,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=379, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-02-08 08:46:51,984 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2025-02-08 08:46:51,984 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 379 flow [2025-02-08 08:46:51,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.619047619047619) internal successors, (160), 21 states have internal predecessors, (160), 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-08 08:46:51,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:51,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:51,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:46:52,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:52,186 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:52,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:52,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1102638139, now seen corresponding path program 1 times [2025-02-08 08:46:52,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:52,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991212306] [2025-02-08 08:46:52,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:52,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:46:52,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:46:52,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:52,239 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-08 08:46:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:52,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991212306] [2025-02-08 08:46:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991212306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:46:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747790393] [2025-02-08 08:46:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:52,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:52,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:52,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:52,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:52,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:46:52,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 08:46:52,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:52,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:46:52,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:52,320 INFO L124 PetriNetUnfolderBase]: 206/470 cut-off events. [2025-02-08 08:46:52,321 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2025-02-08 08:46:52,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 470 events. 206/470 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1949 event pairs, 181 based on Foata normal form. 8/468 useless extension candidates. Maximal degree in co-relation 1455. Up to 409 conditions per place. [2025-02-08 08:46:52,324 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 25 selfloop transitions, 1 changer transitions 26/55 dead transitions. [2025-02-08 08:46:52,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 475 flow [2025-02-08 08:46:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-02-08 08:46:52,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2025-02-08 08:46:52,327 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 379 flow. Second operand 3 states and 37 transitions. [2025-02-08 08:46:52,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 475 flow [2025-02-08 08:46:52,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 362 flow, removed 41 selfloop flow, removed 10 redundant places. [2025-02-08 08:46:52,358 INFO L231 Difference]: Finished difference. Result has 60 places, 29 transitions, 117 flow [2025-02-08 08:46:52,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=60, PETRI_TRANSITIONS=29} [2025-02-08 08:46:52,360 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2025-02-08 08:46:52,360 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 29 transitions, 117 flow [2025-02-08 08:46:52,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 08:46:52,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:52,362 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:52,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:46:52,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash -9740183, now seen corresponding path program 3 times [2025-02-08 08:46:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474727865] [2025-02-08 08:46:52,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:46:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:52,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-02-08 08:46:52,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 22 statements. [2025-02-08 08:46:52,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:46:52,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-08 08:46:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:52,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474727865] [2025-02-08 08:46:52,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474727865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:52,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137471426] [2025-02-08 08:46:52,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:46:52,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:52,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:52,465 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-08 08:46:52,467 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-08 08:46:52,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-02-08 08:46:52,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 22 statements. [2025-02-08 08:46:52,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:46:52,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:52,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:46:52,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-08 08:46:52,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:46:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-08 08:46:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137471426] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:46:52,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:46:52,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-08 08:46:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447431700] [2025-02-08 08:46:52,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:46:52,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:46:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:52,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:46:52,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:46:52,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:46:52,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 29 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-08 08:46:52,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:52,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:46:52,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:52,737 INFO L124 PetriNetUnfolderBase]: 166/346 cut-off events. [2025-02-08 08:46:52,738 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2025-02-08 08:46:52,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 346 events. 166/346 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1133 event pairs, 54 based on Foata normal form. 5/347 useless extension candidates. Maximal degree in co-relation 902. Up to 151 conditions per place. [2025-02-08 08:46:52,740 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 25 selfloop transitions, 2 changer transitions 31/60 dead transitions. [2025-02-08 08:46:52,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 333 flow [2025-02-08 08:46:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:46:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:46:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-02-08 08:46:52,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4039408866995074 [2025-02-08 08:46:52,742 INFO L175 Difference]: Start difference. First operand has 60 places, 29 transitions, 117 flow. Second operand 7 states and 82 transitions. [2025-02-08 08:46:52,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 333 flow [2025-02-08 08:46:52,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 277 flow, removed 19 selfloop flow, removed 11 redundant places. [2025-02-08 08:46:52,744 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 82 flow [2025-02-08 08:46:52,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2025-02-08 08:46:52,744 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2025-02-08 08:46:52,744 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 82 flow [2025-02-08 08:46:52,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-08 08:46:52,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:52,745 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:52,755 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-08 08:46:52,950 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,SelfDestructingSolverStorable5 [2025-02-08 08:46:52,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:52,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1517346713, now seen corresponding path program 1 times [2025-02-08 08:46:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659390950] [2025-02-08 08:46:52,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:52,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:46:52,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:46:52,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659390950] [2025-02-08 08:46:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659390950] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218809817] [2025-02-08 08:46:53,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:53,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:53,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:53,174 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-08 08:46:53,177 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-08 08:46:53,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:46:53,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:46:53,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:53,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:53,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:46:53,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:53,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:46:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:53,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218809817] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:46:53,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:46:53,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2025-02-08 08:46:53,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601231435] [2025-02-08 08:46:53,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:46:53,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 08:46:53,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:53,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 08:46:53,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 08:46:53,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-08 08:46:53,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 82 flow. Second operand has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 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-08 08:46:53,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:53,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-08 08:46:53,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:54,192 INFO L124 PetriNetUnfolderBase]: 142/299 cut-off events. [2025-02-08 08:46:54,193 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 08:46:54,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 299 events. 142/299 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 690 event pairs, 15 based on Foata normal form. 60/359 useless extension candidates. Maximal degree in co-relation 769. Up to 76 conditions per place. [2025-02-08 08:46:54,195 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 80 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2025-02-08 08:46:54,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 525 flow [2025-02-08 08:46:54,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 08:46:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-08 08:46:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 299 transitions. [2025-02-08 08:46:54,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2025-02-08 08:46:54,197 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 82 flow. Second operand 26 states and 299 transitions. [2025-02-08 08:46:54,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 525 flow [2025-02-08 08:46:54,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 107 transitions, 511 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-08 08:46:54,199 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 240 flow [2025-02-08 08:46:54,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=240, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2025-02-08 08:46:54,200 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2025-02-08 08:46:54,201 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 240 flow [2025-02-08 08:46:54,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 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-08 08:46:54,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:54,201 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:54,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:46:54,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:54,403 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:54,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:54,403 INFO L85 PathProgramCache]: Analyzing trace with hash 932185511, now seen corresponding path program 2 times [2025-02-08 08:46:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:54,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923470475] [2025-02-08 08:46:54,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:46:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:54,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-08 08:46:54,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:46:54,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:46:54,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:54,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:54,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923470475] [2025-02-08 08:46:54,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923470475] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:54,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241107764] [2025-02-08 08:46:54,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:46:54,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:54,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:54,902 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-08 08:46:54,906 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-08 08:46:54,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-08 08:46:54,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:46:54,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:46:54,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:54,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 08:46:54,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:55,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:46:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:56,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241107764] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:46:56,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:46:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-02-08 08:46:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165243642] [2025-02-08 08:46:56,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:46:56,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-02-08 08:46:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:56,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-02-08 08:46:56,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2025-02-08 08:46:56,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:46:56,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 240 flow. Second operand has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 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-08 08:46:56,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:56,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:46:56,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:58,415 INFO L124 PetriNetUnfolderBase]: 262/539 cut-off events. [2025-02-08 08:46:58,415 INFO L125 PetriNetUnfolderBase]: For 8312/8312 co-relation queries the response was YES. [2025-02-08 08:46:58,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 539 events. 262/539 cut-off events. For 8312/8312 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1250 event pairs, 15 based on Foata normal form. 120/659 useless extension candidates. Maximal degree in co-relation 1825. Up to 196 conditions per place. [2025-02-08 08:46:58,419 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 152 selfloop transitions, 49 changer transitions 0/203 dead transitions. [2025-02-08 08:46:58,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 1163 flow [2025-02-08 08:46:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-08 08:46:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-02-08 08:46:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 525 transitions. [2025-02-08 08:46:58,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2025-02-08 08:46:58,422 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 240 flow. Second operand 50 states and 525 transitions. [2025-02-08 08:46:58,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 1163 flow [2025-02-08 08:46:58,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 203 transitions, 1015 flow, removed 61 selfloop flow, removed 13 redundant places. [2025-02-08 08:46:58,428 INFO L231 Difference]: Finished difference. Result has 128 places, 62 transitions, 480 flow [2025-02-08 08:46:58,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=480, PETRI_PLACES=128, PETRI_TRANSITIONS=62} [2025-02-08 08:46:58,429 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2025-02-08 08:46:58,429 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 62 transitions, 480 flow [2025-02-08 08:46:58,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 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-08 08:46:58,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:58,430 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:58,437 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-08 08:46:58,634 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,SelfDestructingSolverStorable7 [2025-02-08 08:46:58,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:46:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1914187815, now seen corresponding path program 3 times [2025-02-08 08:46:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652132866] [2025-02-08 08:46:58,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:46:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:58,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 24 equivalence classes. [2025-02-08 08:46:58,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 08:46:58,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-02-08 08:46:58,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:59,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652132866] [2025-02-08 08:46:59,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652132866] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462014107] [2025-02-08 08:46:59,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:46:59,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:59,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:59,929 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-08 08:46:59,930 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-08 08:46:59,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 24 equivalence classes. [2025-02-08 08:46:59,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 08:46:59,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-02-08 08:46:59,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:59,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-08 08:46:59,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:01,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:47:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:05,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462014107] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:47:05,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:47:05,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-02-08 08:47:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710490014] [2025-02-08 08:47:05,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:47:05,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2025-02-08 08:47:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:47:05,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2025-02-08 08:47:05,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2025-02-08 08:47:05,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:47:05,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 62 transitions, 480 flow. Second operand has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 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-08 08:47:05,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:05,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:47:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:11,693 INFO L124 PetriNetUnfolderBase]: 502/1019 cut-off events. [2025-02-08 08:47:11,693 INFO L125 PetriNetUnfolderBase]: For 154388/154388 co-relation queries the response was YES. [2025-02-08 08:47:11,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1019 events. 502/1019 cut-off events. For 154388/154388 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2369 event pairs, 15 based on Foata normal form. 240/1259 useless extension candidates. Maximal degree in co-relation 3625. Up to 376 conditions per place. [2025-02-08 08:47:11,699 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 296 selfloop transitions, 97 changer transitions 0/395 dead transitions. [2025-02-08 08:47:11,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 395 transitions, 2315 flow [2025-02-08 08:47:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-02-08 08:47:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2025-02-08 08:47:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1029 transitions. [2025-02-08 08:47:11,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2025-02-08 08:47:11,703 INFO L175 Difference]: Start difference. First operand has 128 places, 62 transitions, 480 flow. Second operand 98 states and 1029 transitions. [2025-02-08 08:47:11,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 395 transitions, 2315 flow [2025-02-08 08:47:11,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 395 transitions, 2023 flow, removed 121 selfloop flow, removed 25 redundant places. [2025-02-08 08:47:11,740 INFO L231 Difference]: Finished difference. Result has 248 places, 110 transitions, 960 flow [2025-02-08 08:47:11,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=960, PETRI_PLACES=248, PETRI_TRANSITIONS=110} [2025-02-08 08:47:11,741 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2025-02-08 08:47:11,741 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 110 transitions, 960 flow [2025-02-08 08:47:11,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 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-08 08:47:11,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:11,742 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:11,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:47:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:11,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -66976473, now seen corresponding path program 4 times [2025-02-08 08:47:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:47:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594560342] [2025-02-08 08:47:11,949 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:47:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:47:11,958 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-02-08 08:47:11,993 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 08:47:11,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:47:11,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:15,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:47:15,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594560342] [2025-02-08 08:47:15,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594560342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:47:15,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975457524] [2025-02-08 08:47:15,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:47:15,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:15,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:15,947 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-08 08:47:15,948 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-08 08:47:15,987 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-02-08 08:47:16,021 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 08:47:16,022 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:47:16,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:16,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-08 08:47:16,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:19,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:47:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:22,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975457524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:47:22,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:47:22,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2025-02-08 08:47:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799746266] [2025-02-08 08:47:22,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:47:22,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2025-02-08 08:47:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:47:22,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2025-02-08 08:47:22,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15048, Invalid=25554, Unknown=0, NotChecked=0, Total=40602 [2025-02-08 08:47:22,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-08 08:47:22,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 110 transitions, 960 flow. Second operand has 202 states, 202 states have (on average 8.064356435643564) internal successors, (1629), 202 states have internal predecessors, (1629), 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-08 08:47:22,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:22,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-08 08:47:22,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:29,495 INFO L124 PetriNetUnfolderBase]: 537/1089 cut-off events. [2025-02-08 08:47:29,495 INFO L125 PetriNetUnfolderBase]: For 139341/139341 co-relation queries the response was YES. [2025-02-08 08:47:29,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4202 conditions, 1089 events. 537/1089 cut-off events. For 139341/139341 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2535 event pairs, 15 based on Foata normal form. 35/1124 useless extension candidates. Maximal degree in co-relation 4110. Up to 291 conditions per place. [2025-02-08 08:47:29,502 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 317 selfloop transitions, 104 changer transitions 0/423 dead transitions. [2025-02-08 08:47:29,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 423 transitions, 2572 flow [2025-02-08 08:47:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-02-08 08:47:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-02-08 08:47:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1163 transitions. [2025-02-08 08:47:29,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819376026272578 [2025-02-08 08:47:29,509 INFO L175 Difference]: Start difference. First operand has 248 places, 110 transitions, 960 flow. Second operand 105 states and 1163 transitions. [2025-02-08 08:47:29,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 423 transitions, 2572 flow [2025-02-08 08:47:29,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 423 transitions, 2170 flow, removed 152 selfloop flow, removed 49 redundant places. [2025-02-08 08:47:29,617 INFO L231 Difference]: Finished difference. Result has 310 places, 117 transitions, 852 flow [2025-02-08 08:47:29,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=852, PETRI_PLACES=310, PETRI_TRANSITIONS=117} [2025-02-08 08:47:29,617 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 281 predicate places. [2025-02-08 08:47:29,617 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 117 transitions, 852 flow [2025-02-08 08:47:29,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 202 states, 202 states have (on average 8.064356435643564) internal successors, (1629), 202 states have internal predecessors, (1629), 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-08 08:47:29,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:29,618 INFO L206 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:29,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:47:29,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:29,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:29,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:29,820 INFO L85 PathProgramCache]: Analyzing trace with hash 133614062, now seen corresponding path program 5 times [2025-02-08 08:47:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:47:29,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274392107] [2025-02-08 08:47:29,820 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:47:29,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:47:29,826 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 113 statements into 52 equivalence classes. [2025-02-08 08:47:29,898 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 08:47:29,899 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-02-08 08:47:29,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:47:29,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:47:29,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 08:47:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 08:47:29,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:47:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:47:29,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:47:29,983 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:47:29,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-02-08 08:47:29,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-08 08:47:29,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-08 08:47:29,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-08 08:47:29,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-08 08:47:29,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:47:29,985 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1] [2025-02-08 08:47:30,095 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:47:30,095 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:47:30,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:47:30 BasicIcfg [2025-02-08 08:47:30,100 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:47:30,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:47:30,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:47:30,101 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:47:30,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:46:48" (3/4) ... [2025-02-08 08:47:30,102 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:47:30,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:47:30,103 INFO L158 Benchmark]: Toolchain (without parser) took 41901.69ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 104.0MB in the beginning and 370.9MB in the end (delta: -266.9MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2025-02-08 08:47:30,103 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:47:30,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.39ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 83.6MB in the end (delta: 19.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:47:30,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.86ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:47:30,104 INFO L158 Benchmark]: Boogie Preprocessor took 17.95ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 80.6MB in the end (delta: 992.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:47:30,104 INFO L158 Benchmark]: IcfgBuilder took 308.40ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 60.9MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:47:30,104 INFO L158 Benchmark]: TraceAbstraction took 41158.65ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 59.9MB in the beginning and 371.0MB in the end (delta: -311.1MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2025-02-08 08:47:30,105 INFO L158 Benchmark]: Witness Printer took 2.31ms. Allocated memory is still 520.1MB. Free memory was 371.0MB in the beginning and 370.9MB in the end (delta: 166.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:47:30,106 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.15ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.39ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 83.6MB in the end (delta: 19.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.86ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.95ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 80.6MB in the end (delta: 992.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 308.40ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 60.9MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41158.65ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 59.9MB in the beginning and 371.0MB in the end (delta: -311.1MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * Witness Printer took 2.31ms. Allocated memory is still 520.1MB. Free memory was 371.0MB in the beginning and 370.9MB in the end (delta: 166.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-1, t2=0] [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L752] 2 __assert_fail ("0", "generated/unwind1.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] - UnprovableResult [Line: 771]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 775]: 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. - UnprovableResult [Line: 776]: 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 5 procedures, 43 locations, 5 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: 40.9s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5838 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5837 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2942 IncrementalHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 1 mSDtfsCounter, 2942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1050 GetRequests, 158 SyntacticMatches, 94 SemanticMatches, 798 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57623 ImplicationChecksByTransitivity, 28.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=9, InterpolantAutomatonStates: 334, 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, 20.8s InterpolantComputationTime, 701 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 3823 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1167 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 136/17762 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-08 08:47:30,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-theta/unwind1-100.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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:47:31,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:47:32,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:47:32,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:47:32,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:47:32,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:47:32,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:47:32,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:47:32,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:47:32,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:47:32,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:47:32,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:47:32,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:47:32,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:47:32,075 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:47:32,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:47:32,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:47:32,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:47:32,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:47:32,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:47:32,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:47:32,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:47:32,077 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:47:32,077 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:47:32,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:47:32,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:47:32,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:47:32,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:47:32,077 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-02-08 08:47:32,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:47:32,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:47:32,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:47:32,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:47:32,321 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:47:32,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-02-08 08:47:33,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1cd7d580/b67efb9b9a8549d5b59c88a631b76258/FLAG47d3191c7 [2025-02-08 08:47:33,657 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:47:33,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-02-08 08:47:33,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1cd7d580/b67efb9b9a8549d5b59c88a631b76258/FLAG47d3191c7 [2025-02-08 08:47:33,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1cd7d580/b67efb9b9a8549d5b59c88a631b76258 [2025-02-08 08:47:33,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:47:33,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:47:33,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:47:33,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:47:33,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:47:33,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:47:33" (1/1) ... [2025-02-08 08:47:33,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75776d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:33, skipping insertion in model container [2025-02-08 08:47:33,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:47:33" (1/1) ... [2025-02-08 08:47:33,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:47:33,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:47:33,965 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:47:33,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:47:34,032 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:47:34,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34 WrapperNode [2025-02-08 08:47:34,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:47:34,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:47:34,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:47:34,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:47:34,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,059 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 54 [2025-02-08 08:47:34,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:47:34,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:47:34,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:47:34,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:47:34,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,083 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-08 08:47:34,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:47:34,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:47:34,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:47:34,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:47:34,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (1/1) ... [2025-02-08 08:47:34,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:47:34,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:34,127 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-08 08:47:34,131 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-08 08:47:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:47:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-08 08:47:34,145 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-08 08:47:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-08 08:47:34,145 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-08 08:47:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:47:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:47:34,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:47:34,146 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:47:34,241 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:47:34,242 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:47:34,356 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:47:34,357 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:47:34,465 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:47:34,465 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:47:34,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:47:34 BoogieIcfgContainer [2025-02-08 08:47:34,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:47:34,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:47:34,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:47:34,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:47:34,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:47:33" (1/3) ... [2025-02-08 08:47:34,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d73eda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:47:34, skipping insertion in model container [2025-02-08 08:47:34,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:47:34" (2/3) ... [2025-02-08 08:47:34,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d73eda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:47:34, skipping insertion in model container [2025-02-08 08:47:34,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:47:34" (3/3) ... [2025-02-08 08:47:34,473 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-02-08 08:47:34,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:47:34,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-08 08:47:34,485 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:47:34,541 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:47:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2025-02-08 08:47:34,588 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-02-08 08:47:34,590 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:47:34,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 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/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-02-08 08:47:34,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2025-02-08 08:47:34,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-02-08 08:47:34,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:47:34,611 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;@62d1d34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:47:34,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 08:47:34,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:47:34,619 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-02-08 08:47:34,619 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:47:34,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:34,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:34,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:34,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2061330347, now seen corresponding path program 1 times [2025-02-08 08:47:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:34,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828534366] [2025-02-08 08:47:34,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:47:34,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:34,633 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-08 08:47:34,635 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-08 08:47:34,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:47:34,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:47:34,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:47:34,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:34,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:47:34,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:34,768 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-08 08:47:34,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:47:34,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:34,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828534366] [2025-02-08 08:47:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828534366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:47:34,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:47:34,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:47:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437461454] [2025-02-08 08:47:34,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:47:34,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:47:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:34,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:47:34,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:47:34,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-08 08:47:34,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-08 08:47:34,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:34,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-08 08:47:34,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:34,943 INFO L124 PetriNetUnfolderBase]: 165/337 cut-off events. [2025-02-08 08:47:34,944 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 08:47:34,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 337 events. 165/337 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1377 event pairs, 83 based on Foata normal form. 39/332 useless extension candidates. Maximal degree in co-relation 588. Up to 187 conditions per place. [2025-02-08 08:47:34,947 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2025-02-08 08:47:34,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 183 flow [2025-02-08 08:47:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:47:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:47:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-02-08 08:47:34,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5241379310344828 [2025-02-08 08:47:34,955 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 5 states and 76 transitions. [2025-02-08 08:47:34,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 183 flow [2025-02-08 08:47:34,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 43 transitions, 169 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:47:34,959 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 80 flow [2025-02-08 08:47:34,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2025-02-08 08:47:34,962 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2025-02-08 08:47:34,962 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 80 flow [2025-02-08 08:47:34,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-08 08:47:34,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:34,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:34,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:47:35,163 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-08 08:47:35,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:35,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -524254582, now seen corresponding path program 1 times [2025-02-08 08:47:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:35,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004026598] [2025-02-08 08:47:35,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:47:35,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:35,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:35,171 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-08 08:47:35,172 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-08 08:47:35,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:47:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:47:35,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:47:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:35,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:47:35,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:35,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:47:35,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:35,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004026598] [2025-02-08 08:47:35,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004026598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:47:35,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:47:35,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:47:35,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450509269] [2025-02-08 08:47:35,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:47:35,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:47:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:35,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:47:35,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:47:35,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-08 08:47:35,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-08 08:47:35,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:35,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-08 08:47:35,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:35,356 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2025-02-08 08:47:35,356 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-02-08 08:47:35,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 247 events. 111/247 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 939 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 260. Up to 97 conditions per place. [2025-02-08 08:47:35,358 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2025-02-08 08:47:35,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 216 flow [2025-02-08 08:47:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:47:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:47:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-02-08 08:47:35,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-02-08 08:47:35,361 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 80 flow. Second operand 5 states and 73 transitions. [2025-02-08 08:47:35,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 216 flow [2025-02-08 08:47:35,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:47:35,363 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 111 flow [2025-02-08 08:47:35,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-02-08 08:47:35,364 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2025-02-08 08:47:35,364 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 111 flow [2025-02-08 08:47:35,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-08 08:47:35,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:35,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:35,372 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-08 08:47:35,564 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-08 08:47:35,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:35,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:35,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2003139732, now seen corresponding path program 1 times [2025-02-08 08:47:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:35,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451344506] [2025-02-08 08:47:35,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:47:35,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:35,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:35,568 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-08 08:47:35,569 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-08 08:47:35,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:47:35,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:47:35,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:47:35,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:35,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:47:35,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:35,675 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-08 08:47:35,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:47:35,724 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-08 08:47:35,724 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451344506] [2025-02-08 08:47:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451344506] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:47:35,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:47:35,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 08:47:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179053067] [2025-02-08 08:47:35,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:47:35,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:47:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:35,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:47:35,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:47:35,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-08 08:47:35,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 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-08 08:47:35,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:35,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-08 08:47:35,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:35,982 INFO L124 PetriNetUnfolderBase]: 163/372 cut-off events. [2025-02-08 08:47:35,982 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-02-08 08:47:35,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 372 events. 163/372 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1636 event pairs, 63 based on Foata normal form. 10/362 useless extension candidates. Maximal degree in co-relation 554. Up to 93 conditions per place. [2025-02-08 08:47:35,984 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2025-02-08 08:47:35,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 375 flow [2025-02-08 08:47:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:47:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:47:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2025-02-08 08:47:35,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445141065830721 [2025-02-08 08:47:35,985 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 111 flow. Second operand 11 states and 142 transitions. [2025-02-08 08:47:35,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 375 flow [2025-02-08 08:47:35,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:47:35,990 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 196 flow [2025-02-08 08:47:35,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2025-02-08 08:47:35,991 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2025-02-08 08:47:35,992 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 196 flow [2025-02-08 08:47:35,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 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-08 08:47:35,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:35,992 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:35,998 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-08 08:47:36,196 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-08 08:47:36,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:36,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash -422478617, now seen corresponding path program 1 times [2025-02-08 08:47:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:36,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950162220] [2025-02-08 08:47:36,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:47:36,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:36,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:36,200 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-08 08:47:36,201 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-08 08:47:36,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:47:36,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:47:36,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:47:36,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:36,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:47:36,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:36,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:47:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:36,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950162220] [2025-02-08 08:47:36,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950162220] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:47:36,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:47:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-08 08:47:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834455315] [2025-02-08 08:47:36,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:47:36,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:47:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:36,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:47:36,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:47:36,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:47:36,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 196 flow. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 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-08 08:47:36,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:36,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:47:36,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:36,693 INFO L124 PetriNetUnfolderBase]: 317/674 cut-off events. [2025-02-08 08:47:36,693 INFO L125 PetriNetUnfolderBase]: For 672/672 co-relation queries the response was YES. [2025-02-08 08:47:36,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 674 events. 317/674 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3177 event pairs, 71 based on Foata normal form. 30/692 useless extension candidates. Maximal degree in co-relation 1279. Up to 148 conditions per place. [2025-02-08 08:47:36,696 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 72 selfloop transitions, 28 changer transitions 0/104 dead transitions. [2025-02-08 08:47:36,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 633 flow [2025-02-08 08:47:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:47:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 08:47:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 185 transitions. [2025-02-08 08:47:36,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2025-02-08 08:47:36,697 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 196 flow. Second operand 15 states and 185 transitions. [2025-02-08 08:47:36,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 633 flow [2025-02-08 08:47:36,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 580 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-02-08 08:47:36,702 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 339 flow [2025-02-08 08:47:36,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=339, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-02-08 08:47:36,703 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2025-02-08 08:47:36,703 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 339 flow [2025-02-08 08:47:36,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 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-08 08:47:36,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:36,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:36,711 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-08 08:47:36,907 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-08 08:47:36,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1102638139, now seen corresponding path program 1 times [2025-02-08 08:47:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469769734] [2025-02-08 08:47:36,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:47:36,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:36,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:36,910 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-08 08:47:36,911 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-08 08:47:36,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:47:36,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:47:36,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:47:36,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:36,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:47:36,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:36,986 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-08 08:47:36,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:47:36,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469769734] [2025-02-08 08:47:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469769734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:47:36,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:47:36,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:47:36,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020014629] [2025-02-08 08:47:36,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:47:36,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:47:36,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:36,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:47:36,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:47:36,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:47:36,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 08:47:36,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:36,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:47:36,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:37,052 INFO L124 PetriNetUnfolderBase]: 253/590 cut-off events. [2025-02-08 08:47:37,052 INFO L125 PetriNetUnfolderBase]: For 1090/1090 co-relation queries the response was YES. [2025-02-08 08:47:37,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 590 events. 253/590 cut-off events. For 1090/1090 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2936 event pairs, 243 based on Foata normal form. 10/590 useless extension candidates. Maximal degree in co-relation 1801. Up to 512 conditions per place. [2025-02-08 08:47:37,054 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 29 selfloop transitions, 1 changer transitions 17/50 dead transitions. [2025-02-08 08:47:37,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 50 transitions, 427 flow [2025-02-08 08:47:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:47:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:47:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-02-08 08:47:37,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2025-02-08 08:47:37,055 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 339 flow. Second operand 3 states and 37 transitions. [2025-02-08 08:47:37,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 50 transitions, 427 flow [2025-02-08 08:47:37,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 330 flow, removed 36 selfloop flow, removed 7 redundant places. [2025-02-08 08:47:37,060 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 153 flow [2025-02-08 08:47:37,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-02-08 08:47:37,061 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2025-02-08 08:47:37,061 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 153 flow [2025-02-08 08:47:37,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08 08:47:37,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:37,061 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:37,067 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-08 08:47:37,265 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-08 08:47:37,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:37,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash -69447767, now seen corresponding path program 2 times [2025-02-08 08:47:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703079219] [2025-02-08 08:47:37,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:47:37,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:37,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:37,269 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-08 08:47:37,270 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-08 08:47:37,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 08:47:37,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:47:37,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:47:37,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:37,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:47:37,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:37,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:47:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:37,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:37,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703079219] [2025-02-08 08:47:37,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703079219] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:47:37,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:47:37,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-02-08 08:47:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277782329] [2025-02-08 08:47:37,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:47:37,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:47:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:37,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:47:37,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-02-08 08:47:37,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:47:37,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 153 flow. Second operand has 20 states, 20 states have (on average 7.6) internal successors, (152), 20 states have internal predecessors, (152), 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-08 08:47:37,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:37,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:47:37,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:38,279 INFO L124 PetriNetUnfolderBase]: 371/766 cut-off events. [2025-02-08 08:47:38,279 INFO L125 PetriNetUnfolderBase]: For 1034/1034 co-relation queries the response was YES. [2025-02-08 08:47:38,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 766 events. 371/766 cut-off events. For 1034/1034 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3315 event pairs, 51 based on Foata normal form. 80/842 useless extension candidates. Maximal degree in co-relation 2157. Up to 191 conditions per place. [2025-02-08 08:47:38,281 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 57 selfloop transitions, 31 changer transitions 44/134 dead transitions. [2025-02-08 08:47:38,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 746 flow [2025-02-08 08:47:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 08:47:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-08 08:47:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 280 transitions. [2025-02-08 08:47:38,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3713527851458886 [2025-02-08 08:47:38,283 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 153 flow. Second operand 26 states and 280 transitions. [2025-02-08 08:47:38,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 746 flow [2025-02-08 08:47:38,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 694 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-02-08 08:47:38,286 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 331 flow [2025-02-08 08:47:38,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=331, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2025-02-08 08:47:38,286 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2025-02-08 08:47:38,286 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 331 flow [2025-02-08 08:47:38,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.6) internal successors, (152), 20 states have internal predecessors, (152), 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-08 08:47:38,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:38,286 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:38,296 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-08 08:47:38,491 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-08 08:47:38,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:38,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1887170263, now seen corresponding path program 3 times [2025-02-08 08:47:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:38,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445884777] [2025-02-08 08:47:38,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:47:38,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:38,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:38,495 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-08 08:47:38,496 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-08 08:47:38,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 8 equivalence classes. [2025-02-08 08:47:38,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-02-08 08:47:38,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:47:38,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:38,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:47:38,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-08 08:47:38,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:47:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-08 08:47:38,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:38,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445884777] [2025-02-08 08:47:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445884777] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:47:38,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:47:38,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2025-02-08 08:47:38,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691195785] [2025-02-08 08:47:38,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:47:38,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:47:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:38,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:47:38,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:47:39,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:47:39,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 331 flow. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 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-08 08:47:39,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:39,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:47:39,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:39,367 INFO L124 PetriNetUnfolderBase]: 196/406 cut-off events. [2025-02-08 08:47:39,368 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2025-02-08 08:47:39,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 406 events. 196/406 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1328 event pairs, 57 based on Foata normal form. 5/407 useless extension candidates. Maximal degree in co-relation 1427. Up to 180 conditions per place. [2025-02-08 08:47:39,369 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 30 selfloop transitions, 4 changer transitions 33/69 dead transitions. [2025-02-08 08:47:39,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 532 flow [2025-02-08 08:47:39,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:47:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:47:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-02-08 08:47:39,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.367816091954023 [2025-02-08 08:47:39,371 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 331 flow. Second operand 9 states and 96 transitions. [2025-02-08 08:47:39,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 532 flow [2025-02-08 08:47:39,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 427 flow, removed 40 selfloop flow, removed 15 redundant places. [2025-02-08 08:47:39,374 INFO L231 Difference]: Finished difference. Result has 60 places, 30 transitions, 149 flow [2025-02-08 08:47:39,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=30} [2025-02-08 08:47:39,374 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2025-02-08 08:47:39,374 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 30 transitions, 149 flow [2025-02-08 08:47:39,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 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-08 08:47:39,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:39,375 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:39,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:47:39,579 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-08 08:47:39,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:39,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -39083481, now seen corresponding path program 2 times [2025-02-08 08:47:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:39,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263156579] [2025-02-08 08:47:39,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:47:39,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:39,582 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-08 08:47:39,583 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-08 08:47:39,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 08:47:39,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:47:39,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:47:39,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:39,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:47:39,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:39,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:47:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:40,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:40,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263156579] [2025-02-08 08:47:40,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263156579] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:47:40,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:47:40,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2025-02-08 08:47:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963049444] [2025-02-08 08:47:40,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:47:40,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 08:47:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:40,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 08:47:40,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=934, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 08:47:40,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:47:40,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 30 transitions, 149 flow. Second operand has 36 states, 36 states have (on average 7.333333333333333) internal successors, (264), 36 states have internal predecessors, (264), 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-08 08:47:40,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:40,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:47:40,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:47:43,335 INFO L124 PetriNetUnfolderBase]: 262/539 cut-off events. [2025-02-08 08:47:43,335 INFO L125 PetriNetUnfolderBase]: For 3229/3229 co-relation queries the response was YES. [2025-02-08 08:47:43,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 539 events. 262/539 cut-off events. For 3229/3229 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1547 event pairs, 27 based on Foata normal form. 80/619 useless extension candidates. Maximal degree in co-relation 2315. Up to 176 conditions per place. [2025-02-08 08:47:43,337 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 102 selfloop transitions, 32 changer transitions 64/200 dead transitions. [2025-02-08 08:47:43,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 200 transitions, 1347 flow [2025-02-08 08:47:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-08 08:47:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-02-08 08:47:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 508 transitions. [2025-02-08 08:47:43,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3574947220267417 [2025-02-08 08:47:43,339 INFO L175 Difference]: Start difference. First operand has 60 places, 30 transitions, 149 flow. Second operand 49 states and 508 transitions. [2025-02-08 08:47:43,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 200 transitions, 1347 flow [2025-02-08 08:47:43,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 200 transitions, 1279 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-02-08 08:47:43,343 INFO L231 Difference]: Finished difference. Result has 124 places, 46 transitions, 403 flow [2025-02-08 08:47:43,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=403, PETRI_PLACES=124, PETRI_TRANSITIONS=46} [2025-02-08 08:47:43,344 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2025-02-08 08:47:43,344 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 46 transitions, 403 flow [2025-02-08 08:47:43,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.333333333333333) internal successors, (264), 36 states have internal predecessors, (264), 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-08 08:47:43,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:47:43,344 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:47:43,351 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-08 08:47:43,548 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-08 08:47:43,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:47:43,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:47:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash -426186457, now seen corresponding path program 3 times [2025-02-08 08:47:43,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:47:43,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837755024] [2025-02-08 08:47:43,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:47:43,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:47:43,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:47:43,551 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-08 08:47:43,552 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-08 08:47:43,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 16 equivalence classes. [2025-02-08 08:47:43,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 08:47:43,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-02-08 08:47:43,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:47:43,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 08:47:43,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:47:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:44,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:47:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:47:46,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:47:46,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837755024] [2025-02-08 08:47:46,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837755024] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:47:46,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:47:46,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2025-02-08 08:47:46,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880696011] [2025-02-08 08:47:46,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:47:46,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-02-08 08:47:46,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:47:46,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-02-08 08:47:46,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1158, Invalid=3398, Unknown=0, NotChecked=0, Total=4556 [2025-02-08 08:47:46,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:47:46,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 46 transitions, 403 flow. Second operand has 68 states, 68 states have (on average 7.176470588235294) internal successors, (488), 68 states have internal predecessors, (488), 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-08 08:47:46,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:47:46,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:47:46,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:48:01,321 INFO L124 PetriNetUnfolderBase]: 502/1019 cut-off events. [2025-02-08 08:48:01,321 INFO L125 PetriNetUnfolderBase]: For 65457/65457 co-relation queries the response was YES. [2025-02-08 08:48:01,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7480 conditions, 1019 events. 502/1019 cut-off events. For 65457/65457 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3120 event pairs, 27 based on Foata normal form. 160/1179 useless extension candidates. Maximal degree in co-relation 7431. Up to 416 conditions per place. [2025-02-08 08:48:01,329 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 198 selfloop transitions, 64 changer transitions 128/392 dead transitions. [2025-02-08 08:48:01,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 392 transitions, 3825 flow [2025-02-08 08:48:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-02-08 08:48:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2025-02-08 08:48:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 1004 transitions. [2025-02-08 08:48:01,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35691432634198367 [2025-02-08 08:48:01,336 INFO L175 Difference]: Start difference. First operand has 124 places, 46 transitions, 403 flow. Second operand 97 states and 1004 transitions. [2025-02-08 08:48:01,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 392 transitions, 3825 flow [2025-02-08 08:48:01,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 392 transitions, 3567 flow, removed 113 selfloop flow, removed 32 redundant places. [2025-02-08 08:48:01,408 INFO L231 Difference]: Finished difference. Result has 236 places, 78 transitions, 787 flow [2025-02-08 08:48:01,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=787, PETRI_PLACES=236, PETRI_TRANSITIONS=78} [2025-02-08 08:48:01,410 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 207 predicate places. [2025-02-08 08:48:01,410 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 78 transitions, 787 flow [2025-02-08 08:48:01,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 7.176470588235294) internal successors, (488), 68 states have internal predecessors, (488), 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-08 08:48:01,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:48:01,411 INFO L206 CegarLoopForPetriNet]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:01,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:48:01,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:01,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:48:01,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1009350439, now seen corresponding path program 4 times [2025-02-08 08:48:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:48:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984171127] [2025-02-08 08:48:01,614 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:48:01,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:01,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:01,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:01,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:48:01,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-02-08 08:48:01,693 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 08:48:01,693 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:48:01,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:01,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 08:48:01,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:48:03,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:48:10,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:48:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984171127] [2025-02-08 08:48:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984171127] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:10,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:48:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 131 [2025-02-08 08:48:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479162604] [2025-02-08 08:48:10,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-02-08 08:48:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:48:10,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-02-08 08:48:10,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4058, Invalid=13234, Unknown=0, NotChecked=0, Total=17292 [2025-02-08 08:48:10,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-08 08:48:10,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 78 transitions, 787 flow. Second operand has 132 states, 132 states have (on average 7.090909090909091) internal successors, (936), 132 states have internal predecessors, (936), 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-08 08:48:10,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:48:10,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-08 08:48:10,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand