./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/triangular-longest-2.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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:35:18,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:35:18,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:35:18,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:35:18,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:35:18,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:35:18,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:35:18,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:35:18,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:35:18,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:35:18,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:35:18,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:35:18,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:35:18,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:35:18,212 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:35:18,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:35:18,212 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:35:18,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:35:18,218 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:35:18,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:18,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:35:18,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:35:18,219 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2025-02-06 12:35:18,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:35:18,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:35:18,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:35:18,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:35:18,479 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:35:18,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2025-02-06 12:35:19,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bc4512c7/4e48ec9ed2a94e2baee0e1d92cb199d6/FLAG44d7661fa [2025-02-06 12:35:19,995 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:35:19,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2025-02-06 12:35:20,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bc4512c7/4e48ec9ed2a94e2baee0e1d92cb199d6/FLAG44d7661fa [2025-02-06 12:35:20,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bc4512c7/4e48ec9ed2a94e2baee0e1d92cb199d6 [2025-02-06 12:35:20,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:35:20,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:35:20,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:20,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:35:20,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:35:20,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f45945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20, skipping insertion in model container [2025-02-06 12:35:20,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:35:20,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:20,447 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:35:20,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:20,494 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:35:20,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20 WrapperNode [2025-02-06 12:35:20,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:20,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:20,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:35:20,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:35:20,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,515 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-02-06 12:35:20,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:20,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:35:20,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:35:20,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:35:20,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,528 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:35:20,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:35:20,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:35:20,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:35:20,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:35:20,534 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (1/1) ... [2025-02-06 12:35:20,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:20,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:20,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:35:20,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:35:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 12:35:20,583 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 12:35:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 12:35:20,583 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 12:35:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:35:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:35:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:35:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:35:20,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:35:20,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:35:20,584 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:35:20,657 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:35:20,658 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:35:20,775 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:35:20,777 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:35:20,853 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:35:20,856 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:35:20,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:20 BoogieIcfgContainer [2025-02-06 12:35:20,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:35:20,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:35:20,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:35:20,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:35:20,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:35:20" (1/3) ... [2025-02-06 12:35:20,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a64e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:20, skipping insertion in model container [2025-02-06 12:35:20,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:20" (2/3) ... [2025-02-06 12:35:20,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a64e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:20, skipping insertion in model container [2025-02-06 12:35:20,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:20" (3/3) ... [2025-02-06 12:35:20,865 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-02-06 12:35:20,874 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:35:20,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 12:35:20,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:35:20,904 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:35:20,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-02-06 12:35:20,949 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-02-06 12:35:20,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:20,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-02-06 12:35:20,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-02-06 12:35:20,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-02-06 12:35:20,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:20,987 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;@1b3e311a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:20,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 12:35:20,996 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:21,000 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-02-06 12:35:21,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:21,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:21,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:21,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:21,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1499979287, now seen corresponding path program 1 times [2025-02-06 12:35:21,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102739613] [2025-02-06 12:35:21,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:21,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:35:21,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:35:21,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:21,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102739613] [2025-02-06 12:35:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102739613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:21,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:21,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:35:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607324875] [2025-02-06 12:35:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:21,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:21,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:21,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:21,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:21,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:21,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:21,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:21,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:21,324 INFO L124 PetriNetUnfolderBase]: 185/363 cut-off events. [2025-02-06 12:35:21,324 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:35:21,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 363 events. 185/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1602 event pairs, 135 based on Foata normal form. 32/390 useless extension candidates. Maximal degree in co-relation 657. Up to 290 conditions per place. [2025-02-06 12:35:21,328 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 15 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2025-02-06 12:35:21,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 86 flow [2025-02-06 12:35:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-06 12:35:21,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2025-02-06 12:35:21,338 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 44 transitions. [2025-02-06 12:35:21,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 86 flow [2025-02-06 12:35:21,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:21,342 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2025-02-06 12:35:21,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-02-06 12:35:21,346 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2025-02-06 12:35:21,346 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2025-02-06 12:35:21,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:21,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:21,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:21,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:35:21,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:21,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1499979786, now seen corresponding path program 1 times [2025-02-06 12:35:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038874841] [2025-02-06 12:35:21,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:21,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:35:21,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:35:21,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:21,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038874841] [2025-02-06 12:35:21,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038874841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:21,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:21,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:35:21,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411652019] [2025-02-06 12:35:21,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:21,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:35:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:21,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:35:21,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:35:21,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:21,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:21,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:21,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:21,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:21,645 INFO L124 PetriNetUnfolderBase]: 273/491 cut-off events. [2025-02-06 12:35:21,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:21,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 491 events. 273/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2024 event pairs, 45 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 925. Up to 181 conditions per place. [2025-02-06 12:35:21,651 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2025-02-06 12:35:21,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2025-02-06 12:35:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:35:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:35:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-02-06 12:35:21,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-02-06 12:35:21,654 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2025-02-06 12:35:21,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2025-02-06 12:35:21,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:35:21,656 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2025-02-06 12:35:21,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2025-02-06 12:35:21,658 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2025-02-06 12:35:21,658 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2025-02-06 12:35:21,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:21,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:21,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:21,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:35:21,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:21,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1591607260, now seen corresponding path program 1 times [2025-02-06 12:35:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:21,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-02-06 12:35:21,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:35:21,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:35:21,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:21,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-02-06 12:35:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64727775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:21,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:35:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271946085] [2025-02-06 12:35:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:35:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:21,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:35:21,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:35:21,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:21,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:21,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:21,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:21,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:22,043 INFO L124 PetriNetUnfolderBase]: 382/707 cut-off events. [2025-02-06 12:35:22,044 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2025-02-06 12:35:22,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 707 events. 382/707 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3107 event pairs, 65 based on Foata normal form. 33/739 useless extension candidates. Maximal degree in co-relation 1594. Up to 246 conditions per place. [2025-02-06 12:35:22,049 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2025-02-06 12:35:22,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2025-02-06 12:35:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:35:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:35:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-02-06 12:35:22,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-02-06 12:35:22,052 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2025-02-06 12:35:22,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2025-02-06 12:35:22,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:22,057 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2025-02-06 12:35:22,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-02-06 12:35:22,058 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2025-02-06 12:35:22,058 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2025-02-06 12:35:22,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:22,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:22,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:22,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:35:22,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:22,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:22,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1595175136, now seen corresponding path program 2 times [2025-02-06 12:35:22,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:22,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-02-06 12:35:22,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:22,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:22,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:35:22,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:35:22,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:35:22,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:22,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:22,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-02-06 12:35:22,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428772396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:22,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:22,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:35:22,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590675522] [2025-02-06 12:35:22,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:22,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:35:22,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:22,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:35:22,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:35:22,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:22,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:22,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:22,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:22,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:22,367 INFO L124 PetriNetUnfolderBase]: 328/614 cut-off events. [2025-02-06 12:35:22,367 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2025-02-06 12:35:22,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 614 events. 328/614 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2617 event pairs, 65 based on Foata normal form. 57/670 useless extension candidates. Maximal degree in co-relation 1726. Up to 234 conditions per place. [2025-02-06 12:35:22,370 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2025-02-06 12:35:22,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2025-02-06 12:35:22,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:35:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:35:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-02-06 12:35:22,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2025-02-06 12:35:22,371 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2025-02-06 12:35:22,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2025-02-06 12:35:22,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 12:35:22,375 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2025-02-06 12:35:22,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2025-02-06 12:35:22,376 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-02-06 12:35:22,376 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2025-02-06 12:35:22,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:22,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:22,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:22,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:35:22,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:22,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 29952673, now seen corresponding path program 1 times [2025-02-06 12:35:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824142220] [2025-02-06 12:35:22,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:22,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:35:22,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:35:22,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:22,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:22,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:22,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824142220] [2025-02-06 12:35:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824142220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:22,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:35:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449234450] [2025-02-06 12:35:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:35:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:22,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:35:22,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:35:22,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:22,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:22,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:22,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:22,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:22,972 INFO L124 PetriNetUnfolderBase]: 355/668 cut-off events. [2025-02-06 12:35:22,972 INFO L125 PetriNetUnfolderBase]: For 1815/1827 co-relation queries the response was YES. [2025-02-06 12:35:22,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 668 events. 355/668 cut-off events. For 1815/1827 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2929 event pairs, 80 based on Foata normal form. 21/688 useless extension candidates. Maximal degree in co-relation 2052. Up to 258 conditions per place. [2025-02-06 12:35:22,976 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 43 selfloop transitions, 16 changer transitions 21/84 dead transitions. [2025-02-06 12:35:22,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 600 flow [2025-02-06 12:35:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:35:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:35:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-02-06 12:35:22,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-02-06 12:35:22,977 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 9 states and 140 transitions. [2025-02-06 12:35:22,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 600 flow [2025-02-06 12:35:22,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 530 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-02-06 12:35:22,983 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 300 flow [2025-02-06 12:35:22,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=300, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-02-06 12:35:22,983 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-02-06 12:35:22,983 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 300 flow [2025-02-06 12:35:22,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:22,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:22,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:22,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:35:22,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:22,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1774460803, now seen corresponding path program 2 times [2025-02-06 12:35:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:22,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-02-06 12:35:22,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:22,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:22,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:35:22,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:35:22,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:35:22,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-02-06 12:35:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520830732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:23,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:35:23,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586306854] [2025-02-06 12:35:23,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:23,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:35:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:23,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:35:23,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:35:23,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:23,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:23,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:23,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:23,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:23,270 INFO L124 PetriNetUnfolderBase]: 526/980 cut-off events. [2025-02-06 12:35:23,271 INFO L125 PetriNetUnfolderBase]: For 3325/3337 co-relation queries the response was YES. [2025-02-06 12:35:23,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 980 events. 526/980 cut-off events. For 3325/3337 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4650 event pairs, 53 based on Foata normal form. 39/1016 useless extension candidates. Maximal degree in co-relation 3173. Up to 256 conditions per place. [2025-02-06 12:35:23,277 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 57 selfloop transitions, 22 changer transitions 23/106 dead transitions. [2025-02-06 12:35:23,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 796 flow [2025-02-06 12:35:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:35:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:35:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2025-02-06 12:35:23,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-02-06 12:35:23,280 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 300 flow. Second operand 11 states and 174 transitions. [2025-02-06 12:35:23,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 796 flow [2025-02-06 12:35:23,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 736 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-02-06 12:35:23,287 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 410 flow [2025-02-06 12:35:23,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=410, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-02-06 12:35:23,288 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-02-06 12:35:23,289 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 410 flow [2025-02-06 12:35:23,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:23,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:23,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:23,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:35:23,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:23,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1950453345, now seen corresponding path program 3 times [2025-02-06 12:35:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:23,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649438680] [2025-02-06 12:35:23,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:35:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:23,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:35:23,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:35:23,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:35:23,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649438680] [2025-02-06 12:35:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649438680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:35:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556964495] [2025-02-06 12:35:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:35:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:23,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:35:23,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:35:23,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:23,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:23,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:23,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:23,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:23,623 INFO L124 PetriNetUnfolderBase]: 463/878 cut-off events. [2025-02-06 12:35:23,623 INFO L125 PetriNetUnfolderBase]: For 5153/5165 co-relation queries the response was YES. [2025-02-06 12:35:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3299 conditions, 878 events. 463/878 cut-off events. For 5153/5165 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4098 event pairs, 71 based on Foata normal form. 57/932 useless extension candidates. Maximal degree in co-relation 3269. Up to 226 conditions per place. [2025-02-06 12:35:23,627 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 22 changer transitions 31/101 dead transitions. [2025-02-06 12:35:23,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 934 flow [2025-02-06 12:35:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:35:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:35:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-02-06 12:35:23,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-02-06 12:35:23,628 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 410 flow. Second operand 10 states and 155 transitions. [2025-02-06 12:35:23,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 934 flow [2025-02-06 12:35:23,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 868 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-02-06 12:35:23,636 INFO L231 Difference]: Finished difference. Result has 72 places, 49 transitions, 466 flow [2025-02-06 12:35:23,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=466, PETRI_PLACES=72, PETRI_TRANSITIONS=49} [2025-02-06 12:35:23,637 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2025-02-06 12:35:23,637 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 466 flow [2025-02-06 12:35:23,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:23,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:23,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:23,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:35:23,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:23,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1345523814, now seen corresponding path program 1 times [2025-02-06 12:35:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:23,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401919043] [2025-02-06 12:35:23,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:23,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:23,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:35:23,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:35:23,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:23,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401919043] [2025-02-06 12:35:23,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401919043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:23,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:23,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:35:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028870557] [2025-02-06 12:35:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:23,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:35:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:23,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:35:23,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:35:23,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:23,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 466 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:23,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:23,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:23,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:23,958 INFO L124 PetriNetUnfolderBase]: 472/887 cut-off events. [2025-02-06 12:35:23,959 INFO L125 PetriNetUnfolderBase]: For 6011/6023 co-relation queries the response was YES. [2025-02-06 12:35:23,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3467 conditions, 887 events. 472/887 cut-off events. For 6011/6023 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4149 event pairs, 59 based on Foata normal form. 30/914 useless extension candidates. Maximal degree in co-relation 3434. Up to 160 conditions per place. [2025-02-06 12:35:23,964 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 45 selfloop transitions, 28 changer transitions 23/100 dead transitions. [2025-02-06 12:35:23,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 964 flow [2025-02-06 12:35:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:35:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:35:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-02-06 12:35:23,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-02-06 12:35:23,966 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 466 flow. Second operand 10 states and 155 transitions. [2025-02-06 12:35:23,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 964 flow [2025-02-06 12:35:23,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 882 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-02-06 12:35:23,985 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 546 flow [2025-02-06 12:35:23,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2025-02-06 12:35:23,986 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2025-02-06 12:35:23,986 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 546 flow [2025-02-06 12:35:23,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:23,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:23,989 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:23,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:35:23,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:23,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash 51256293, now seen corresponding path program 1 times [2025-02-06 12:35:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:23,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772680247] [2025-02-06 12:35:23,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:23,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:35:24,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:35:24,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:24,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:24,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:24,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772680247] [2025-02-06 12:35:24,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772680247] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:24,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533280336] [2025-02-06 12:35:24,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:24,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:24,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:24,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:24,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:35:24,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:35:24,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:35:24,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:24,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:24,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 12:35:24,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:24,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:24,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533280336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:24,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 12:35:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14708686] [2025-02-06 12:35:24,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:24,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:35:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:24,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:35:24,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:35:24,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:24,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 546 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:24,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:24,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:24,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:24,874 INFO L124 PetriNetUnfolderBase]: 616/1163 cut-off events. [2025-02-06 12:35:24,874 INFO L125 PetriNetUnfolderBase]: For 10829/10841 co-relation queries the response was YES. [2025-02-06 12:35:24,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 1163 events. 616/1163 cut-off events. For 10829/10841 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5206 event pairs, 161 based on Foata normal form. 75/1237 useless extension candidates. Maximal degree in co-relation 4952. Up to 540 conditions per place. [2025-02-06 12:35:24,880 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 68 selfloop transitions, 19 changer transitions 67/158 dead transitions. [2025-02-06 12:35:24,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 1624 flow [2025-02-06 12:35:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 12:35:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 12:35:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2025-02-06 12:35:24,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2025-02-06 12:35:24,882 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 546 flow. Second operand 19 states and 288 transitions. [2025-02-06 12:35:24,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 1624 flow [2025-02-06 12:35:24,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 158 transitions, 1528 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-02-06 12:35:24,893 INFO L231 Difference]: Finished difference. Result has 96 places, 58 transitions, 683 flow [2025-02-06 12:35:24,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=683, PETRI_PLACES=96, PETRI_TRANSITIONS=58} [2025-02-06 12:35:24,893 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2025-02-06 12:35:24,894 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 58 transitions, 683 flow [2025-02-06 12:35:24,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:24,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:24,894 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:24,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:35:25,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:25,095 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:25,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1429829831, now seen corresponding path program 2 times [2025-02-06 12:35:25,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:25,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687963097] [2025-02-06 12:35:25,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:25,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:25,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 12:35:25,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:35:25,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:35:25,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:25,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:25,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687963097] [2025-02-06 12:35:25,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687963097] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:25,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142669251] [2025-02-06 12:35:25,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:25,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:25,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:25,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:35:25,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 12:35:25,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:35:25,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:35:25,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:25,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:35:25,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:25,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142669251] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:25,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:25,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-06 12:35:25,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645136654] [2025-02-06 12:35:25,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:25,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:35:25,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:25,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:35:25,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:35:25,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:25,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 58 transitions, 683 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:25,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:25,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:25,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:25,900 INFO L124 PetriNetUnfolderBase]: 904/1691 cut-off events. [2025-02-06 12:35:25,900 INFO L125 PetriNetUnfolderBase]: For 37645/37657 co-relation queries the response was YES. [2025-02-06 12:35:25,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9526 conditions, 1691 events. 904/1691 cut-off events. For 37645/37657 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8392 event pairs, 74 based on Foata normal form. 84/1774 useless extension candidates. Maximal degree in co-relation 9481. Up to 321 conditions per place. [2025-02-06 12:35:25,940 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 89 selfloop transitions, 49 changer transitions 80/222 dead transitions. [2025-02-06 12:35:25,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 222 transitions, 2891 flow [2025-02-06 12:35:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 12:35:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-02-06 12:35:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 415 transitions. [2025-02-06 12:35:25,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5300127713920817 [2025-02-06 12:35:25,943 INFO L175 Difference]: Start difference. First operand has 96 places, 58 transitions, 683 flow. Second operand 27 states and 415 transitions. [2025-02-06 12:35:25,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 222 transitions, 2891 flow [2025-02-06 12:35:25,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 222 transitions, 2344 flow, removed 261 selfloop flow, removed 12 redundant places. [2025-02-06 12:35:25,965 INFO L231 Difference]: Finished difference. Result has 122 places, 74 transitions, 1088 flow [2025-02-06 12:35:25,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1088, PETRI_PLACES=122, PETRI_TRANSITIONS=74} [2025-02-06 12:35:25,966 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2025-02-06 12:35:25,966 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 74 transitions, 1088 flow [2025-02-06 12:35:25,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:25,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:25,967 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:25,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:35:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:26,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1043992632, now seen corresponding path program 1 times [2025-02-06 12:35:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:26,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195616294] [2025-02-06 12:35:26,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:26,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:35:26,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:35:26,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:26,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195616294] [2025-02-06 12:35:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195616294] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911620608] [2025-02-06 12:35:26,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:26,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:26,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:26,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:35:26,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:35:26,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:35:26,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:26,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:26,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:35:26,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:26,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911620608] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:26,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:26,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-06 12:35:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952568272] [2025-02-06 12:35:26,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:26,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:35:26,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:26,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:35:26,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:35:26,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:26,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 74 transitions, 1088 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 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-06 12:35:26,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:26,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:26,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:27,063 INFO L124 PetriNetUnfolderBase]: 1138/2163 cut-off events. [2025-02-06 12:35:27,063 INFO L125 PetriNetUnfolderBase]: For 88272/88278 co-relation queries the response was YES. [2025-02-06 12:35:27,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14943 conditions, 2163 events. 1138/2163 cut-off events. For 88272/88278 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11504 event pairs, 153 based on Foata normal form. 69/2229 useless extension candidates. Maximal degree in co-relation 14886. Up to 490 conditions per place. [2025-02-06 12:35:27,079 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 99 selfloop transitions, 54 changer transitions 67/224 dead transitions. [2025-02-06 12:35:27,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 224 transitions, 3706 flow [2025-02-06 12:35:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 12:35:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-06 12:35:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 384 transitions. [2025-02-06 12:35:27,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296551724137931 [2025-02-06 12:35:27,081 INFO L175 Difference]: Start difference. First operand has 122 places, 74 transitions, 1088 flow. Second operand 25 states and 384 transitions. [2025-02-06 12:35:27,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 224 transitions, 3706 flow [2025-02-06 12:35:27,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 224 transitions, 3123 flow, removed 275 selfloop flow, removed 13 redundant places. [2025-02-06 12:35:27,130 INFO L231 Difference]: Finished difference. Result has 140 places, 85 transitions, 1379 flow [2025-02-06 12:35:27,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1379, PETRI_PLACES=140, PETRI_TRANSITIONS=85} [2025-02-06 12:35:27,132 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2025-02-06 12:35:27,132 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 85 transitions, 1379 flow [2025-02-06 12:35:27,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 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-06 12:35:27,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:27,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:27,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:35:27,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:27,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:27,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash -230915460, now seen corresponding path program 2 times [2025-02-06 12:35:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:27,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446253103] [2025-02-06 12:35:27,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:27,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:27,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 12:35:27,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:35:27,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:35:27,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:27,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446253103] [2025-02-06 12:35:27,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446253103] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973249370] [2025-02-06 12:35:27,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:27,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:27,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:27,451 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:27,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:35:27,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 12:35:27,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:35:27,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:35:27,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:27,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:35:27,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:27,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973249370] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:27,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:27,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-06 12:35:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919302034] [2025-02-06 12:35:27,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:27,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:35:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:27,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:35:27,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:35:27,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:27,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 85 transitions, 1379 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 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-06 12:35:27,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:27,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:27,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:28,428 INFO L124 PetriNetUnfolderBase]: 1255/2407 cut-off events. [2025-02-06 12:35:28,428 INFO L125 PetriNetUnfolderBase]: For 140501/140507 co-relation queries the response was YES. [2025-02-06 12:35:28,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18013 conditions, 2407 events. 1255/2407 cut-off events. For 140501/140507 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12959 event pairs, 65 based on Foata normal form. 141/2545 useless extension candidates. Maximal degree in co-relation 17950. Up to 507 conditions per place. [2025-02-06 12:35:28,448 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 89 selfloop transitions, 79 changer transitions 98/270 dead transitions. [2025-02-06 12:35:28,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 270 transitions, 5249 flow [2025-02-06 12:35:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 12:35:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-02-06 12:35:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 429 transitions. [2025-02-06 12:35:28,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5283251231527094 [2025-02-06 12:35:28,450 INFO L175 Difference]: Start difference. First operand has 140 places, 85 transitions, 1379 flow. Second operand 28 states and 429 transitions. [2025-02-06 12:35:28,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 270 transitions, 5249 flow [2025-02-06 12:35:28,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 270 transitions, 4472 flow, removed 350 selfloop flow, removed 18 redundant places. [2025-02-06 12:35:28,541 INFO L231 Difference]: Finished difference. Result has 161 places, 106 transitions, 2008 flow [2025-02-06 12:35:28,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2008, PETRI_PLACES=161, PETRI_TRANSITIONS=106} [2025-02-06 12:35:28,542 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2025-02-06 12:35:28,542 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 106 transitions, 2008 flow [2025-02-06 12:35:28,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 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-06 12:35:28,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:28,543 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:28,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:35:28,743 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,SelfDestructingSolverStorable11 [2025-02-06 12:35:28,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:28,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1186221288, now seen corresponding path program 3 times [2025-02-06 12:35:28,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:28,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860231466] [2025-02-06 12:35:28,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:35:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:28,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 5 equivalence classes. [2025-02-06 12:35:28,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:35:28,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 12:35:28,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:28,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860231466] [2025-02-06 12:35:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860231466] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433198962] [2025-02-06 12:35:28,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:35:28,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:28,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:28,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:35:28,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 5 equivalence classes. [2025-02-06 12:35:28,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:35:28,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 12:35:28,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:28,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 12:35:28,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:28,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433198962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:29,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-02-06 12:35:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263719609] [2025-02-06 12:35:29,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:29,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 12:35:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:29,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 12:35:29,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-02-06 12:35:29,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:29,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 106 transitions, 2008 flow. Second operand has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:29,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:29,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:29,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:30,319 INFO L124 PetriNetUnfolderBase]: 1723/3198 cut-off events. [2025-02-06 12:35:30,320 INFO L125 PetriNetUnfolderBase]: For 262206/262212 co-relation queries the response was YES. [2025-02-06 12:35:30,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27712 conditions, 3198 events. 1723/3198 cut-off events. For 262206/262212 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 16169 event pairs, 42 based on Foata normal form. 96/3293 useless extension candidates. Maximal degree in co-relation 27639. Up to 681 conditions per place. [2025-02-06 12:35:30,347 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 142 selfloop transitions, 115 changer transitions 135/396 dead transitions. [2025-02-06 12:35:30,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 396 transitions, 8460 flow [2025-02-06 12:35:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 12:35:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-02-06 12:35:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 703 transitions. [2025-02-06 12:35:30,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5269865067466267 [2025-02-06 12:35:30,354 INFO L175 Difference]: Start difference. First operand has 161 places, 106 transitions, 2008 flow. Second operand 46 states and 703 transitions. [2025-02-06 12:35:30,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 396 transitions, 8460 flow [2025-02-06 12:35:30,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 396 transitions, 7151 flow, removed 626 selfloop flow, removed 18 redundant places. [2025-02-06 12:35:30,533 INFO L231 Difference]: Finished difference. Result has 208 places, 140 transitions, 3111 flow [2025-02-06 12:35:30,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3111, PETRI_PLACES=208, PETRI_TRANSITIONS=140} [2025-02-06 12:35:30,534 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2025-02-06 12:35:30,534 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 140 transitions, 3111 flow [2025-02-06 12:35:30,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:30,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:30,534 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:30,540 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-06 12:35:30,738 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,SelfDestructingSolverStorable12 [2025-02-06 12:35:30,738 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:30,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -275691621, now seen corresponding path program 4 times [2025-02-06 12:35:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313014169] [2025-02-06 12:35:30,742 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:35:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:30,750 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-02-06 12:35:30,757 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 12:35:30,761 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:35:30,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313014169] [2025-02-06 12:35:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313014169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948944698] [2025-02-06 12:35:31,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:35:31,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:31,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:31,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:31,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:35:31,075 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-02-06 12:35:31,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 12:35:31,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:35:31,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:31,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:35:31,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:31,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:31,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948944698] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:31,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2025-02-06 12:35:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883090942] [2025-02-06 12:35:31,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:31,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 12:35:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:31,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 12:35:31,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 12:35:31,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:31,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 140 transitions, 3111 flow. Second operand has 35 states, 35 states have (on average 10.028571428571428) internal successors, (351), 35 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:31,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:31,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:31,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:33,248 INFO L124 PetriNetUnfolderBase]: 2227/4290 cut-off events. [2025-02-06 12:35:33,248 INFO L125 PetriNetUnfolderBase]: For 593468/593474 co-relation queries the response was YES. [2025-02-06 12:35:33,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46045 conditions, 4290 events. 2227/4290 cut-off events. For 593468/593474 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 22475 event pairs, 421 based on Foata normal form. 159/4446 useless extension candidates. Maximal degree in co-relation 45954. Up to 1483 conditions per place. [2025-02-06 12:35:33,289 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 190 selfloop transitions, 102 changer transitions 189/485 dead transitions. [2025-02-06 12:35:33,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 485 transitions, 13868 flow [2025-02-06 12:35:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-06 12:35:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-02-06 12:35:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 818 transitions. [2025-02-06 12:35:33,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5128526645768025 [2025-02-06 12:35:33,292 INFO L175 Difference]: Start difference. First operand has 208 places, 140 transitions, 3111 flow. Second operand 55 states and 818 transitions. [2025-02-06 12:35:33,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 485 transitions, 13868 flow [2025-02-06 12:35:33,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 485 transitions, 10154 flow, removed 1815 selfloop flow, removed 29 redundant places. [2025-02-06 12:35:33,802 INFO L231 Difference]: Finished difference. Result has 256 places, 182 transitions, 4008 flow [2025-02-06 12:35:33,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=4008, PETRI_PLACES=256, PETRI_TRANSITIONS=182} [2025-02-06 12:35:33,803 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2025-02-06 12:35:33,803 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 182 transitions, 4008 flow [2025-02-06 12:35:33,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.028571428571428) internal successors, (351), 35 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:33,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:33,803 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:33,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:35:34,003 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,SelfDestructingSolverStorable13 [2025-02-06 12:35:34,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:34,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash 298707663, now seen corresponding path program 5 times [2025-02-06 12:35:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154427889] [2025-02-06 12:35:34,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:35:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:34,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 5 equivalence classes. [2025-02-06 12:35:34,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 12:35:34,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 12:35:34,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:34,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:34,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154427889] [2025-02-06 12:35:34,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154427889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:34,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321825321] [2025-02-06 12:35:34,232 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:35:34,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:34,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:34,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:34,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:35:34,269 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 5 equivalence classes. [2025-02-06 12:35:34,281 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 12:35:34,282 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 12:35:34,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:34,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:35:34,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:34,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321825321] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:34,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:34,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2025-02-06 12:35:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670902545] [2025-02-06 12:35:34,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:34,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 12:35:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:34,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 12:35:34,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 12:35:34,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:34,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 182 transitions, 4008 flow. Second operand has 36 states, 36 states have (on average 10.083333333333334) internal successors, (363), 36 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:34,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:34,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:34,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:36,804 INFO L124 PetriNetUnfolderBase]: 2776/5543 cut-off events. [2025-02-06 12:35:36,805 INFO L125 PetriNetUnfolderBase]: For 989874/989880 co-relation queries the response was YES. [2025-02-06 12:35:36,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61739 conditions, 5543 events. 2776/5543 cut-off events. For 989874/989880 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 31446 event pairs, 194 based on Foata normal form. 159/5701 useless extension candidates. Maximal degree in co-relation 61633. Up to 1383 conditions per place. [2025-02-06 12:35:36,862 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 180 selfloop transitions, 194 changer transitions 201/579 dead transitions. [2025-02-06 12:35:36,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 579 transitions, 16600 flow [2025-02-06 12:35:36,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-02-06 12:35:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-02-06 12:35:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 913 transitions. [2025-02-06 12:35:36,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161107970604861 [2025-02-06 12:35:36,869 INFO L175 Difference]: Start difference. First operand has 256 places, 182 transitions, 4008 flow. Second operand 61 states and 913 transitions. [2025-02-06 12:35:36,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 579 transitions, 16600 flow [2025-02-06 12:35:37,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 579 transitions, 14069 flow, removed 1228 selfloop flow, removed 31 redundant places. [2025-02-06 12:35:37,991 INFO L231 Difference]: Finished difference. Result has 304 places, 243 transitions, 6034 flow [2025-02-06 12:35:37,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=6034, PETRI_PLACES=304, PETRI_TRANSITIONS=243} [2025-02-06 12:35:37,992 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2025-02-06 12:35:37,992 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 243 transitions, 6034 flow [2025-02-06 12:35:37,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.083333333333334) internal successors, (363), 36 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:37,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:37,993 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:37,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:35:38,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:38,197 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:38,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash 861354237, now seen corresponding path program 6 times [2025-02-06 12:35:38,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:38,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720430342] [2025-02-06 12:35:38,198 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 12:35:38,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:38,203 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 6 equivalence classes. [2025-02-06 12:35:38,210 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 12:35:38,211 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 12:35:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720430342] [2025-02-06 12:35:38,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720430342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648032624] [2025-02-06 12:35:38,422 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 12:35:38,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:38,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:38,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:38,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:35:38,460 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 6 equivalence classes. [2025-02-06 12:35:38,477 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 12:35:38,477 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 12:35:38,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:38,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:35:38,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:38,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648032624] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:38,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:38,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2025-02-06 12:35:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590786970] [2025-02-06 12:35:38,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:38,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 12:35:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:38,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 12:35:38,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 12:35:38,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:38,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 243 transitions, 6034 flow. Second operand has 35 states, 35 states have (on average 10.057142857142857) internal successors, (352), 35 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:38,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:38,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:38,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:41,895 INFO L124 PetriNetUnfolderBase]: 3703/7336 cut-off events. [2025-02-06 12:35:41,900 INFO L125 PetriNetUnfolderBase]: For 1947876/1947882 co-relation queries the response was YES. [2025-02-06 12:35:42,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95948 conditions, 7336 events. 3703/7336 cut-off events. For 1947876/1947882 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 42987 event pairs, 83 based on Foata normal form. 159/7492 useless extension candidates. Maximal degree in co-relation 95824. Up to 1830 conditions per place. [2025-02-06 12:35:42,072 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 226 selfloop transitions, 275 changer transitions 205/710 dead transitions. [2025-02-06 12:35:42,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 710 transitions, 23692 flow [2025-02-06 12:35:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-02-06 12:35:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2025-02-06 12:35:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 1081 transitions. [2025-02-06 12:35:42,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5250121418164158 [2025-02-06 12:35:42,079 INFO L175 Difference]: Start difference. First operand has 304 places, 243 transitions, 6034 flow. Second operand 71 states and 1081 transitions. [2025-02-06 12:35:42,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 710 transitions, 23692 flow [2025-02-06 12:35:44,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 710 transitions, 19832 flow, removed 1881 selfloop flow, removed 31 redundant places. [2025-02-06 12:35:44,060 INFO L231 Difference]: Finished difference. Result has 368 places, 304 transitions, 8548 flow [2025-02-06 12:35:44,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4570, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=8548, PETRI_PLACES=368, PETRI_TRANSITIONS=304} [2025-02-06 12:35:44,061 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 338 predicate places. [2025-02-06 12:35:44,061 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 304 transitions, 8548 flow [2025-02-06 12:35:44,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.057142857142857) internal successors, (352), 35 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:44,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:44,062 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:44,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:35:44,262 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,SelfDestructingSolverStorable15 [2025-02-06 12:35:44,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:44,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:44,263 INFO L85 PathProgramCache]: Analyzing trace with hash 303633273, now seen corresponding path program 7 times [2025-02-06 12:35:44,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:44,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697642109] [2025-02-06 12:35:44,265 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 12:35:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:44,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 12:35:44,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 12:35:44,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:44,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:44,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:44,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697642109] [2025-02-06 12:35:44,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697642109] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:44,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723098854] [2025-02-06 12:35:44,629 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 12:35:44,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:44,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:44,631 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:35:44,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:35:44,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 12:35:44,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 12:35:44,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:44,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:44,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 12:35:44,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:44,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:35:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723098854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:45,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2025-02-06 12:35:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657891642] [2025-02-06 12:35:45,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:45,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 12:35:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:45,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 12:35:45,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1519, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 12:35:45,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:45,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 304 transitions, 8548 flow. Second operand has 45 states, 45 states have (on average 10.044444444444444) internal successors, (452), 45 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:45,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:45,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:45,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:50,457 INFO L124 PetriNetUnfolderBase]: 5458/10754 cut-off events. [2025-02-06 12:35:50,458 INFO L125 PetriNetUnfolderBase]: For 4477878/4477884 co-relation queries the response was YES. [2025-02-06 12:35:50,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170400 conditions, 10754 events. 5458/10754 cut-off events. For 4477878/4477884 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 64468 event pairs, 66 based on Foata normal form. 393/11146 useless extension candidates. Maximal degree in co-relation 170251. Up to 2730 conditions per place. [2025-02-06 12:35:50,626 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 313 selfloop transitions, 404 changer transitions 341/1062 dead transitions. [2025-02-06 12:35:50,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1062 transitions, 45015 flow [2025-02-06 12:35:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-02-06 12:35:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-02-06 12:35:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1599 transitions. [2025-02-06 12:35:50,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5251231527093596 [2025-02-06 12:35:50,629 INFO L175 Difference]: Start difference. First operand has 368 places, 304 transitions, 8548 flow. Second operand 105 states and 1599 transitions. [2025-02-06 12:35:50,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 1062 transitions, 45015 flow [2025-02-06 12:35:55,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 1062 transitions, 34677 flow, removed 5073 selfloop flow, removed 36 redundant places. [2025-02-06 12:35:55,941 INFO L231 Difference]: Finished difference. Result has 483 places, 435 transitions, 14013 flow [2025-02-06 12:35:55,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=6142, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=14013, PETRI_PLACES=483, PETRI_TRANSITIONS=435} [2025-02-06 12:35:55,942 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 453 predicate places. [2025-02-06 12:35:55,942 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 435 transitions, 14013 flow [2025-02-06 12:35:55,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.044444444444444) internal successors, (452), 45 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:55,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:55,943 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:35:55,949 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-06 12:35:56,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:56,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:35:56,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1571425393, now seen corresponding path program 8 times [2025-02-06 12:35:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:56,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-02-06 12:35:56,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:56,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-02-06 12:35:56,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 12:35:56,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:35:56,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:35:56,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-02-06 12:35:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372130691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:35:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158326992] [2025-02-06 12:35:56,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:35:56,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:35:56,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:56,769 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-06 12:35:56,770 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-06 12:35:56,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-02-06 12:35:56,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 12:35:56,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:35:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:56,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 12:35:56,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:35:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:35:56,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:35:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:35:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158326992] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:35:57,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:35:57,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 46 [2025-02-06 12:35:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874191593] [2025-02-06 12:35:57,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:35:57,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 12:35:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:57,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 12:35:57,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1695, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 12:35:57,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:35:57,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 435 transitions, 14013 flow. Second operand has 47 states, 47 states have (on average 10.170212765957446) internal successors, (478), 47 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:57,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:57,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:35:57,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:05,101 INFO L124 PetriNetUnfolderBase]: 7537/14449 cut-off events. [2025-02-06 12:36:05,102 INFO L125 PetriNetUnfolderBase]: For 8431027/8431033 co-relation queries the response was YES. [2025-02-06 12:36:05,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250415 conditions, 14449 events. 7537/14449 cut-off events. For 8431027/8431033 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 86979 event pairs, 65 based on Foata normal form. 60/14506 useless extension candidates. Maximal degree in co-relation 250220. Up to 3417 conditions per place. [2025-02-06 12:36:05,409 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 312 selfloop transitions, 579 changer transitions 195/1090 dead transitions. [2025-02-06 12:36:05,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 1090 transitions, 50174 flow [2025-02-06 12:36:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-02-06 12:36:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-02-06 12:36:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1299 transitions. [2025-02-06 12:36:05,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208500400962309 [2025-02-06 12:36:05,411 INFO L175 Difference]: Start difference. First operand has 483 places, 435 transitions, 14013 flow. Second operand 86 states and 1299 transitions. [2025-02-06 12:36:05,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 1090 transitions, 50174 flow [2025-02-06 12:36:23,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 1090 transitions, 32333 flow, removed 8746 selfloop flow, removed 55 redundant places. [2025-02-06 12:36:23,523 INFO L231 Difference]: Finished difference. Result has 510 places, 616 transitions, 15456 flow [2025-02-06 12:36:23,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9074, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=403, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=15456, PETRI_PLACES=510, PETRI_TRANSITIONS=616} [2025-02-06 12:36:23,524 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 480 predicate places. [2025-02-06 12:36:23,524 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 616 transitions, 15456 flow [2025-02-06 12:36:23,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 10.170212765957446) internal successors, (478), 47 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:23,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:23,525 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:23,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 12:36:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 12:36:23,729 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 994843478, now seen corresponding path program 9 times [2025-02-06 12:36:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:23,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724134418] [2025-02-06 12:36:23,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:36:23,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:23,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 20 equivalence classes. [2025-02-06 12:36:23,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 12:36:23,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-02-06 12:36:23,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:23,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:23,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 12:36:23,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 12:36:23,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:23,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:23,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:23,804 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:23,805 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-02-06 12:36:23,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-02-06 12:36:23,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-06 12:36:23,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-06 12:36:23,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:36:23,808 INFO L422 BasicCegarLoop]: Path program histogram: [9, 3, 2, 2, 1, 1, 1] [2025-02-06 12:36:23,925 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:36:23,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:36:23,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:36:23 BasicIcfg [2025-02-06 12:36:23,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:36:23,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:36:23,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:36:23,932 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:36:23,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:20" (3/4) ... [2025-02-06 12:36:23,934 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:36:23,935 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:36:23,936 INFO L158 Benchmark]: Toolchain (without parser) took 63723.07ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 105.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-02-06 12:36:23,936 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:36:23,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.44ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 86.4MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:36:23,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.23ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:36:23,937 INFO L158 Benchmark]: Boogie Preprocessor took 16.94ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 996.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:36:23,938 INFO L158 Benchmark]: IcfgBuilder took 323.78ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 64.3MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:36:23,938 INFO L158 Benchmark]: TraceAbstraction took 63072.91ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 64.3MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-06 12:36:23,938 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 2.8GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 719.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:36:23,939 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.27ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.44ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 86.4MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.23ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.94ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 996.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.78ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 64.3MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 63072.91ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 64.3MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 2.8GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 719.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=7, id1=2, id2=3, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=43, id1=2, id2=3, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=2, id2=3, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L693] 0 __assert_fail ("0", "triangular-longest-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 714]: 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: 713]: 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, 38 locations, 4 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: 62.9s, OverallIterations: 19, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 53.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8389 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8386 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7147 IncrementalHoareTripleChecker+Invalid, 7599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 452 mSolverCounterUnsat, 1 mSDtfsCounter, 7147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1593 GetRequests, 769 SyntacticMatches, 31 SemanticMatches, 793 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22461 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15456occurred in iteration=18, InterpolantAutomatonStates: 589, 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.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1157 NumberOfCodeBlocks, 1157 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1446 ConstructedInterpolants, 0 QuantifiedInterpolants, 5729 SizeOfPredicates, 128 NumberOfNonLiveVariables, 1355 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 38 InterpolantComputations, 8 PerfectInterpolantSequences, 4/3621 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:36:23,956 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/triangular-longest-2.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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:36:26,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:36:26,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:36:26,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:36:26,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:36:26,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:36:26,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:36:26,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:36:26,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:36:26,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:36:26,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:36:26,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:36:26,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:36:26,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:36:26,470 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:36:26,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:36:26,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:36:26,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:36:26,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:36:26,472 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:36:26,472 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:36:26,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:36:26,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:36:26,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:36:26,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:36:26,472 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2025-02-06 12:36:26,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:36:26,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:36:26,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:36:26,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:36:26,758 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:36:26,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2025-02-06 12:36:28,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3f2bdd49/a6b43cc72c8e44349c26501d004fcbc4/FLAG765a11fe7 [2025-02-06 12:36:28,402 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:36:28,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2025-02-06 12:36:28,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3f2bdd49/a6b43cc72c8e44349c26501d004fcbc4/FLAG765a11fe7 [2025-02-06 12:36:28,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3f2bdd49/a6b43cc72c8e44349c26501d004fcbc4 [2025-02-06 12:36:28,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:36:28,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:36:28,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:36:28,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:36:28,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:36:28,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:36:28" (1/1) ... [2025-02-06 12:36:28,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620cab93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:28, skipping insertion in model container [2025-02-06 12:36:28,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:36:28" (1/1) ... [2025-02-06 12:36:28,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:36:28,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:36:28,974 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:36:29,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:36:29,055 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:36:29,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29 WrapperNode [2025-02-06 12:36:29,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:36:29,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:36:29,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:36:29,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:36:29,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,083 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-02-06 12:36:29,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:36:29,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:36:29,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:36:29,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:36:29,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,109 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:36:29,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:36:29,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:36:29,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:36:29,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:36:29,125 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (1/1) ... [2025-02-06 12:36:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:36:29,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:29,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:36:29,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:36:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 12:36:29,177 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 12:36:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 12:36:29,177 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 12:36:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:36:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:36:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:36:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:36:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:36:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:36:29,178 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:36:29,283 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:36:29,284 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:36:29,388 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:36:29,389 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:36:29,507 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:36:29,508 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:36:29,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:36:29 BoogieIcfgContainer [2025-02-06 12:36:29,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:36:29,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:36:29,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:36:29,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:36:29,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:36:28" (1/3) ... [2025-02-06 12:36:29,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1834d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:36:29, skipping insertion in model container [2025-02-06 12:36:29,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:36:29" (2/3) ... [2025-02-06 12:36:29,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1834d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:36:29, skipping insertion in model container [2025-02-06 12:36:29,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:36:29" (3/3) ... [2025-02-06 12:36:29,518 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-02-06 12:36:29,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:36:29,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 12:36:29,530 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:36:29,564 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:29,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-02-06 12:36:29,598 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-02-06 12:36:29,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:29,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-02-06 12:36:29,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-02-06 12:36:29,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-02-06 12:36:29,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:29,624 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;@3287ae6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:29,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 12:36:29,638 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:29,639 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-02-06 12:36:29,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:29,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:29,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:29,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:29,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:29,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1483129001, now seen corresponding path program 1 times [2025-02-06 12:36:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:29,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248554280] [2025-02-06 12:36:29,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:29,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:29,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:29,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:29,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:36:29,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:36:29,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:36:29,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:29,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:29,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:36:29,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:29,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:29,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248554280] [2025-02-06 12:36:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248554280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12996803] [2025-02-06 12:36:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:29,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:29,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:29,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:29,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:29,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:29,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:29,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:29,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:29,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:29,865 INFO L124 PetriNetUnfolderBase]: 185/363 cut-off events. [2025-02-06 12:36:29,865 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 12:36:29,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 363 events. 185/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1602 event pairs, 135 based on Foata normal form. 32/390 useless extension candidates. Maximal degree in co-relation 657. Up to 290 conditions per place. [2025-02-06 12:36:29,869 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 15 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2025-02-06 12:36:29,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 86 flow [2025-02-06 12:36:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-06 12:36:29,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2025-02-06 12:36:29,878 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 44 transitions. [2025-02-06 12:36:29,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 86 flow [2025-02-06 12:36:29,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:36:29,881 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2025-02-06 12:36:29,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-02-06 12:36:29,885 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2025-02-06 12:36:29,885 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2025-02-06 12:36:29,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:29,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:29,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:29,892 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-06 12:36:30,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:30,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:30,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1483128502, now seen corresponding path program 1 times [2025-02-06 12:36:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:30,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157241947] [2025-02-06 12:36:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:30,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:30,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:30,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:30,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:36:30,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 12:36:30,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 12:36:30,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:30,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:30,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:36:30,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:30,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:30,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157241947] [2025-02-06 12:36:30,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157241947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:30,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:36:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486961881] [2025-02-06 12:36:30,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:30,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:30,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:30,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:30,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:30,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:30,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:30,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:30,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:30,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:30,501 INFO L124 PetriNetUnfolderBase]: 328/596 cut-off events. [2025-02-06 12:36:30,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:30,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 596 events. 328/596 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2646 event pairs, 45 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 1123. Up to 243 conditions per place. [2025-02-06 12:36:30,506 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2025-02-06 12:36:30,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2025-02-06 12:36:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:36:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:36:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2025-02-06 12:36:30,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2025-02-06 12:36:30,510 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2025-02-06 12:36:30,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2025-02-06 12:36:30,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:30,512 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2025-02-06 12:36:30,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2025-02-06 12:36:30,515 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2025-02-06 12:36:30,515 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2025-02-06 12:36:30,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:30,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:30,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:30,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:36:30,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:30,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 284669415, now seen corresponding path program 1 times [2025-02-06 12:36:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411507917] [2025-02-06 12:36:30,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:30,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:30,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:30,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:30,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:36:30,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:36:30,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:36:30,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:30,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:30,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:36:30,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:30,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:30,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411507917] [2025-02-06 12:36:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411507917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:30,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:30,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:36:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183084938] [2025-02-06 12:36:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:30,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:36:30,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:30,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:36:30,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:36:30,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:30,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:30,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:30,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:30,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:30,999 INFO L124 PetriNetUnfolderBase]: 247/458 cut-off events. [2025-02-06 12:36:31,000 INFO L125 PetriNetUnfolderBase]: For 414/420 co-relation queries the response was YES. [2025-02-06 12:36:31,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 458 events. 247/458 cut-off events. For 414/420 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1851 event pairs, 48 based on Foata normal form. 18/475 useless extension candidates. Maximal degree in co-relation 1174. Up to 190 conditions per place. [2025-02-06 12:36:31,004 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 9 changer transitions 16/59 dead transitions. [2025-02-06 12:36:31,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 316 flow [2025-02-06 12:36:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:36:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:36:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-02-06 12:36:31,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2025-02-06 12:36:31,006 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 7 states and 110 transitions. [2025-02-06 12:36:31,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 316 flow [2025-02-06 12:36:31,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 12:36:31,012 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 143 flow [2025-02-06 12:36:31,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2025-02-06 12:36:31,013 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-02-06 12:36:31,013 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 143 flow [2025-02-06 12:36:31,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:31,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:31,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:31,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:36:31,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:31,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:31,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 92675750, now seen corresponding path program 1 times [2025-02-06 12:36:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110443708] [2025-02-06 12:36:31,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:31,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:31,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:36:31,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:36:31,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:36:31,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:31,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:31,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:36:31,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:31,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:31,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:31,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110443708] [2025-02-06 12:36:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110443708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:31,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:31,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:36:31,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021520098] [2025-02-06 12:36:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:31,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:36:31,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:31,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:36:31,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:36:31,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:31,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:31,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:31,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:31,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:31,489 INFO L124 PetriNetUnfolderBase]: 391/731 cut-off events. [2025-02-06 12:36:31,490 INFO L125 PetriNetUnfolderBase]: For 1182/1188 co-relation queries the response was YES. [2025-02-06 12:36:31,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 731 events. 391/731 cut-off events. For 1182/1188 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3253 event pairs, 89 based on Foata normal form. 33/763 useless extension candidates. Maximal degree in co-relation 2104. Up to 264 conditions per place. [2025-02-06 12:36:31,505 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2025-02-06 12:36:31,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 517 flow [2025-02-06 12:36:31,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:36:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:36:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-02-06 12:36:31,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-02-06 12:36:31,506 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 143 flow. Second operand 9 states and 144 transitions. [2025-02-06 12:36:31,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 517 flow [2025-02-06 12:36:31,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 478 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-02-06 12:36:31,510 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2025-02-06 12:36:31,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2025-02-06 12:36:31,511 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2025-02-06 12:36:31,511 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2025-02-06 12:36:31,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:31,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:31,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:31,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:36:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:31,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:31,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:31,717 INFO L85 PathProgramCache]: Analyzing trace with hash 89107874, now seen corresponding path program 2 times [2025-02-06 12:36:31,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487642182] [2025-02-06 12:36:31,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:31,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:31,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:31,719 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:31,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:36:31,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:36:31,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:36:31,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:36:31,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:31,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:36:31,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:31,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:31,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487642182] [2025-02-06 12:36:31,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487642182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:31,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:31,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:36:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66546876] [2025-02-06 12:36:31,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:31,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:36:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:31,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:36:31,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:36:31,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:31,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:31,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:31,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:31,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:32,023 INFO L124 PetriNetUnfolderBase]: 346/661 cut-off events. [2025-02-06 12:36:32,023 INFO L125 PetriNetUnfolderBase]: For 2134/2140 co-relation queries the response was YES. [2025-02-06 12:36:32,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2195 conditions, 661 events. 346/661 cut-off events. For 2134/2140 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2921 event pairs, 82 based on Foata normal form. 45/705 useless extension candidates. Maximal degree in co-relation 2172. Up to 273 conditions per place. [2025-02-06 12:36:32,026 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 12 changer transitions 30/86 dead transitions. [2025-02-06 12:36:32,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 655 flow [2025-02-06 12:36:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:36:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:36:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-02-06 12:36:32,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-02-06 12:36:32,028 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 9 states and 140 transitions. [2025-02-06 12:36:32,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 655 flow [2025-02-06 12:36:32,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-02-06 12:36:32,033 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 278 flow [2025-02-06 12:36:32,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-02-06 12:36:32,038 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2025-02-06 12:36:32,038 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 278 flow [2025-02-06 12:36:32,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:32,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:32,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:32,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 12:36:32,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:32,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:32,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash 146694531, now seen corresponding path program 1 times [2025-02-06 12:36:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:32,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277984454] [2025-02-06 12:36:32,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:32,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:32,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:32,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:36:32,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:36:32,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:36:32,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:32,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:32,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:36:32,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:32,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:32,373 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277984454] [2025-02-06 12:36:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277984454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:32,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:32,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:36:32,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439113506] [2025-02-06 12:36:32,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:32,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:36:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:32,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:36:32,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:36:32,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:32,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:32,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:32,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:32,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:32,617 INFO L124 PetriNetUnfolderBase]: 526/1004 cut-off events. [2025-02-06 12:36:32,617 INFO L125 PetriNetUnfolderBase]: For 4650/4656 co-relation queries the response was YES. [2025-02-06 12:36:32,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 1004 events. 526/1004 cut-off events. For 4650/4656 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4920 event pairs, 116 based on Foata normal form. 27/1030 useless extension candidates. Maximal degree in co-relation 3642. Up to 331 conditions per place. [2025-02-06 12:36:32,645 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 15 changer transitions 25/108 dead transitions. [2025-02-06 12:36:32,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 884 flow [2025-02-06 12:36:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:36:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:36:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2025-02-06 12:36:32,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2025-02-06 12:36:32,647 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 278 flow. Second operand 12 states and 190 transitions. [2025-02-06 12:36:32,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 884 flow [2025-02-06 12:36:32,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 108 transitions, 838 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-02-06 12:36:32,652 INFO L231 Difference]: Finished difference. Result has 71 places, 45 transitions, 382 flow [2025-02-06 12:36:32,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=382, PETRI_PLACES=71, PETRI_TRANSITIONS=45} [2025-02-06 12:36:32,653 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2025-02-06 12:36:32,653 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 45 transitions, 382 flow [2025-02-06 12:36:32,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:32,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:32,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:32,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:36:32,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:32,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:32,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1157274665, now seen corresponding path program 2 times [2025-02-06 12:36:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844258218] [2025-02-06 12:36:32,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:32,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:32,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:32,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:32,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:36:32,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:36:32,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:36:32,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:36:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:32,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:36:32,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:32,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:32,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:32,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844258218] [2025-02-06 12:36:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844258218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:32,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:36:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178154092] [2025-02-06 12:36:32,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:32,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:36:32,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:32,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:36:32,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:36:32,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:32,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 45 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:32,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:32,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:32,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:33,224 INFO L124 PetriNetUnfolderBase]: 481/936 cut-off events. [2025-02-06 12:36:33,225 INFO L125 PetriNetUnfolderBase]: For 7976/7982 co-relation queries the response was YES. [2025-02-06 12:36:33,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 936 events. 481/936 cut-off events. For 7976/7982 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4615 event pairs, 126 based on Foata normal form. 45/980 useless extension candidates. Maximal degree in co-relation 3864. Up to 340 conditions per place. [2025-02-06 12:36:33,231 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 53 selfloop transitions, 15 changer transitions 29/101 dead transitions. [2025-02-06 12:36:33,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 101 transitions, 1009 flow [2025-02-06 12:36:33,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:36:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:36:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2025-02-06 12:36:33,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2025-02-06 12:36:33,233 INFO L175 Difference]: Start difference. First operand has 71 places, 45 transitions, 382 flow. Second operand 10 states and 158 transitions. [2025-02-06 12:36:33,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 101 transitions, 1009 flow [2025-02-06 12:36:33,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 836 flow, removed 76 selfloop flow, removed 8 redundant places. [2025-02-06 12:36:33,246 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 387 flow [2025-02-06 12:36:33,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=387, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2025-02-06 12:36:33,247 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2025-02-06 12:36:33,247 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 387 flow [2025-02-06 12:36:33,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:33,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:33,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:33,255 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-06 12:36:33,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:33,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:33,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:33,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1853511785, now seen corresponding path program 3 times [2025-02-06 12:36:33,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:33,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706466744] [2025-02-06 12:36:33,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:36:33,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:33,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:33,451 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:33,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:36:33,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:36:33,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:36:33,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:36:33,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:33,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:36:33,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:33,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:33,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:33,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706466744] [2025-02-06 12:36:33,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706466744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:33,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:33,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:36:33,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554040612] [2025-02-06 12:36:33,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:33,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:36:33,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:33,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:36:33,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:36:33,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:33,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:33,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:33,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:33,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:33,841 INFO L124 PetriNetUnfolderBase]: 436/842 cut-off events. [2025-02-06 12:36:33,841 INFO L125 PetriNetUnfolderBase]: For 6421/6427 co-relation queries the response was YES. [2025-02-06 12:36:33,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3361 conditions, 842 events. 436/842 cut-off events. For 6421/6427 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4073 event pairs, 152 based on Foata normal form. 33/874 useless extension candidates. Maximal degree in co-relation 3327. Up to 555 conditions per place. [2025-02-06 12:36:33,847 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 9 changer transitions 29/96 dead transitions. [2025-02-06 12:36:33,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 96 transitions, 875 flow [2025-02-06 12:36:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:36:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:36:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2025-02-06 12:36:33,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2025-02-06 12:36:33,848 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 387 flow. Second operand 10 states and 153 transitions. [2025-02-06 12:36:33,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 96 transitions, 875 flow [2025-02-06 12:36:33,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 828 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-02-06 12:36:33,858 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 413 flow [2025-02-06 12:36:33,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=413, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2025-02-06 12:36:33,859 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2025-02-06 12:36:33,859 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 413 flow [2025-02-06 12:36:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:33,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:33,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:33,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:36:34,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:34,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:34,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1597813599, now seen corresponding path program 4 times [2025-02-06 12:36:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:34,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [615905251] [2025-02-06 12:36:34,065 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:36:34,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:34,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:34,067 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:34,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:36:34,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-02-06 12:36:34,115 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:36:34,115 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:36:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:34,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:36:34,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:34,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:34,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:34,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615905251] [2025-02-06 12:36:34,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615905251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:34,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:34,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:36:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710379474] [2025-02-06 12:36:34,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:34,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:36:34,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:34,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:36:34,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:36:34,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:34,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 50 transitions, 413 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:34,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:34,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:34,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:34,394 INFO L124 PetriNetUnfolderBase]: 463/890 cut-off events. [2025-02-06 12:36:34,395 INFO L125 PetriNetUnfolderBase]: For 7762/7768 co-relation queries the response was YES. [2025-02-06 12:36:34,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3640 conditions, 890 events. 463/890 cut-off events. For 7762/7768 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4365 event pairs, 152 based on Foata normal form. 18/907 useless extension candidates. Maximal degree in co-relation 3603. Up to 456 conditions per place. [2025-02-06 12:36:34,400 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 16 changer transitions 21/95 dead transitions. [2025-02-06 12:36:34,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 95 transitions, 911 flow [2025-02-06 12:36:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:36:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:36:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-02-06 12:36:34,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-02-06 12:36:34,402 INFO L175 Difference]: Start difference. First operand has 80 places, 50 transitions, 413 flow. Second operand 9 states and 140 transitions. [2025-02-06 12:36:34,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 95 transitions, 911 flow [2025-02-06 12:36:34,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 839 flow, removed 29 selfloop flow, removed 8 redundant places. [2025-02-06 12:36:34,411 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 472 flow [2025-02-06 12:36:34,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=81, PETRI_TRANSITIONS=53} [2025-02-06 12:36:34,412 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2025-02-06 12:36:34,412 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 472 flow [2025-02-06 12:36:34,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:34,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:34,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:34,422 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-06 12:36:34,617 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-06 12:36:34,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:34,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash 979589608, now seen corresponding path program 1 times [2025-02-06 12:36:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:34,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346929608] [2025-02-06 12:36:34,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:34,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:34,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:34,621 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-06 12:36:34,622 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-06 12:36:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:36:34,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:36:34,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:34,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:34,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:36:34,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:34,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:34,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:34,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346929608] [2025-02-06 12:36:34,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346929608] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:34,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:36:34,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-02-06 12:36:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033855489] [2025-02-06 12:36:34,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:36:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:34,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:36:34,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:36:34,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:34,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 53 transitions, 472 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:34,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:34,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:34,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:35,600 INFO L124 PetriNetUnfolderBase]: 697/1288 cut-off events. [2025-02-06 12:36:35,600 INFO L125 PetriNetUnfolderBase]: For 15157/15163 co-relation queries the response was YES. [2025-02-06 12:36:35,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5886 conditions, 1288 events. 697/1288 cut-off events. For 15157/15163 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6106 event pairs, 36 based on Foata normal form. 51/1338 useless extension candidates. Maximal degree in co-relation 5849. Up to 219 conditions per place. [2025-02-06 12:36:35,609 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 43 changer transitions 60/176 dead transitions. [2025-02-06 12:36:35,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 1786 flow [2025-02-06 12:36:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 12:36:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 12:36:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 323 transitions. [2025-02-06 12:36:35,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303776683087028 [2025-02-06 12:36:35,611 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 472 flow. Second operand 21 states and 323 transitions. [2025-02-06 12:36:35,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 1786 flow [2025-02-06 12:36:35,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1697 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-02-06 12:36:35,627 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 897 flow [2025-02-06 12:36:35,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=897, PETRI_PLACES=103, PETRI_TRANSITIONS=69} [2025-02-06 12:36:35,628 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2025-02-06 12:36:35,628 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 897 flow [2025-02-06 12:36:35,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:35,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:35,628 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:35,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 12:36:35,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:35,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:35,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1762401677, now seen corresponding path program 1 times [2025-02-06 12:36:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860020084] [2025-02-06 12:36:35,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:35,832 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:35,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 12:36:35,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:36:35,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:36:35,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:35,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:35,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:36:35,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:35,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:35,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:35,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860020084] [2025-02-06 12:36:35,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860020084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:35,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:35,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:36:35,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552661807] [2025-02-06 12:36:35,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:35,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:36:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:35,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:36:35,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:36:35,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:35,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 69 transitions, 897 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:35,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:35,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:35,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:36,267 INFO L124 PetriNetUnfolderBase]: 679/1286 cut-off events. [2025-02-06 12:36:36,267 INFO L125 PetriNetUnfolderBase]: For 19364/19370 co-relation queries the response was YES. [2025-02-06 12:36:36,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6183 conditions, 1286 events. 679/1286 cut-off events. For 19364/19370 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6464 event pairs, 239 based on Foata normal form. 33/1318 useless extension candidates. Maximal degree in co-relation 6138. Up to 828 conditions per place. [2025-02-06 12:36:36,274 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 73 selfloop transitions, 15 changer transitions 31/123 dead transitions. [2025-02-06 12:36:36,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 123 transitions, 1585 flow [2025-02-06 12:36:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:36:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:36:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-02-06 12:36:36,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2025-02-06 12:36:36,276 INFO L175 Difference]: Start difference. First operand has 103 places, 69 transitions, 897 flow. Second operand 11 states and 168 transitions. [2025-02-06 12:36:36,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 123 transitions, 1585 flow [2025-02-06 12:36:36,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 123 transitions, 1171 flow, removed 188 selfloop flow, removed 14 redundant places. [2025-02-06 12:36:36,321 INFO L231 Difference]: Finished difference. Result has 99 places, 71 transitions, 676 flow [2025-02-06 12:36:36,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=676, PETRI_PLACES=99, PETRI_TRANSITIONS=71} [2025-02-06 12:36:36,321 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2025-02-06 12:36:36,321 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 71 transitions, 676 flow [2025-02-06 12:36:36,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:36,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:36,322 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:36,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 12:36:36,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:36,523 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:36,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash 860098855, now seen corresponding path program 2 times [2025-02-06 12:36:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:36,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723404890] [2025-02-06 12:36:36,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:36,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:36,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:36,527 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:36,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 12:36:36,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 12:36:36,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:36:36,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:36,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:36,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:36:36,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:36,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:36,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723404890] [2025-02-06 12:36:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723404890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:36,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:36:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-02-06 12:36:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406533735] [2025-02-06 12:36:36,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:36,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:36:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:36,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:36:36,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:36:36,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:36,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 71 transitions, 676 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:36,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:36,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:36,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:37,750 INFO L124 PetriNetUnfolderBase]: 1210/2256 cut-off events. [2025-02-06 12:36:37,751 INFO L125 PetriNetUnfolderBase]: For 34086/34092 co-relation queries the response was YES. [2025-02-06 12:36:37,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11035 conditions, 2256 events. 1210/2256 cut-off events. For 34086/34092 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 12176 event pairs, 82 based on Foata normal form. 69/2324 useless extension candidates. Maximal degree in co-relation 10993. Up to 475 conditions per place. [2025-02-06 12:36:37,795 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 129 selfloop transitions, 50 changer transitions 59/242 dead transitions. [2025-02-06 12:36:37,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 242 transitions, 2760 flow [2025-02-06 12:36:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 12:36:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-02-06 12:36:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 421 transitions. [2025-02-06 12:36:37,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5376756066411239 [2025-02-06 12:36:37,797 INFO L175 Difference]: Start difference. First operand has 99 places, 71 transitions, 676 flow. Second operand 27 states and 421 transitions. [2025-02-06 12:36:37,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 242 transitions, 2760 flow [2025-02-06 12:36:37,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 242 transitions, 2561 flow, removed 87 selfloop flow, removed 8 redundant places. [2025-02-06 12:36:37,821 INFO L231 Difference]: Finished difference. Result has 131 places, 93 transitions, 1241 flow [2025-02-06 12:36:37,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1241, PETRI_PLACES=131, PETRI_TRANSITIONS=93} [2025-02-06 12:36:37,823 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2025-02-06 12:36:37,823 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 93 transitions, 1241 flow [2025-02-06 12:36:37,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:37,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:37,823 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:37,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 12:36:38,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:38,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:38,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash 853905203, now seen corresponding path program 3 times [2025-02-06 12:36:38,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:38,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947789497] [2025-02-06 12:36:38,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:36:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:38,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:38,030 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:38,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 12:36:38,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:36:38,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:36:38,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:36:38,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:38,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:36:38,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:38,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:36:38,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947789497] [2025-02-06 12:36:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947789497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:36:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480374272] [2025-02-06 12:36:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:38,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:36:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:38,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:36:38,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:36:38,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:38,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 93 transitions, 1241 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:38,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:38,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:38,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:38,525 INFO L124 PetriNetUnfolderBase]: 1075/2087 cut-off events. [2025-02-06 12:36:38,525 INFO L125 PetriNetUnfolderBase]: For 55759/55765 co-relation queries the response was YES. [2025-02-06 12:36:38,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11294 conditions, 2087 events. 1075/2087 cut-off events. For 55759/55765 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11680 event pairs, 426 based on Foata normal form. 81/2167 useless extension candidates. Maximal degree in co-relation 11238. Up to 1194 conditions per place. [2025-02-06 12:36:38,541 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 93 selfloop transitions, 22 changer transitions 40/159 dead transitions. [2025-02-06 12:36:38,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 159 transitions, 2315 flow [2025-02-06 12:36:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:36:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:36:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2025-02-06 12:36:38,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5391849529780565 [2025-02-06 12:36:38,542 INFO L175 Difference]: Start difference. First operand has 131 places, 93 transitions, 1241 flow. Second operand 11 states and 172 transitions. [2025-02-06 12:36:38,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 159 transitions, 2315 flow [2025-02-06 12:36:38,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 159 transitions, 1780 flow, removed 254 selfloop flow, removed 13 redundant places. [2025-02-06 12:36:38,595 INFO L231 Difference]: Finished difference. Result has 126 places, 96 transitions, 1046 flow [2025-02-06 12:36:38,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1046, PETRI_PLACES=126, PETRI_TRANSITIONS=96} [2025-02-06 12:36:38,597 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2025-02-06 12:36:38,597 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 96 transitions, 1046 flow [2025-02-06 12:36:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:38,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:38,597 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:38,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 12:36:38,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:38,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:38,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2054828168, now seen corresponding path program 1 times [2025-02-06 12:36:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:38,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990535256] [2025-02-06 12:36:38,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:38,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:38,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:38,803 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:38,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 12:36:38,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:36:38,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:36:38,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:38,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:38,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 12:36:38,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:38,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:39,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990535256] [2025-02-06 12:36:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990535256] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:39,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:36:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-02-06 12:36:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985057793] [2025-02-06 12:36:39,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:39,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:36:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:39,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:36:39,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:36:39,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:39,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 96 transitions, 1046 flow. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:39,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:39,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:39,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:40,023 INFO L124 PetriNetUnfolderBase]: 1255/2340 cut-off events. [2025-02-06 12:36:40,024 INFO L125 PetriNetUnfolderBase]: For 46594/46600 co-relation queries the response was YES. [2025-02-06 12:36:40,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11480 conditions, 2340 events. 1255/2340 cut-off events. For 46594/46600 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 12310 event pairs, 62 based on Foata normal form. 78/2417 useless extension candidates. Maximal degree in co-relation 11427. Up to 369 conditions per place. [2025-02-06 12:36:40,038 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 101 selfloop transitions, 75 changer transitions 78/258 dead transitions. [2025-02-06 12:36:40,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 258 transitions, 3063 flow [2025-02-06 12:36:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 12:36:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-06 12:36:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 399 transitions. [2025-02-06 12:36:40,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291777188328912 [2025-02-06 12:36:40,043 INFO L175 Difference]: Start difference. First operand has 126 places, 96 transitions, 1046 flow. Second operand 26 states and 399 transitions. [2025-02-06 12:36:40,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 258 transitions, 3063 flow [2025-02-06 12:36:40,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 258 transitions, 2955 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-02-06 12:36:40,097 INFO L231 Difference]: Finished difference. Result has 155 places, 118 transitions, 1586 flow [2025-02-06 12:36:40,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1586, PETRI_PLACES=155, PETRI_TRANSITIONS=118} [2025-02-06 12:36:40,098 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2025-02-06 12:36:40,098 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 118 transitions, 1586 flow [2025-02-06 12:36:40,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:40,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:40,098 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:40,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 12:36:40,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:40,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:40,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1613716725, now seen corresponding path program 2 times [2025-02-06 12:36:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [133667311] [2025-02-06 12:36:40,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:36:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:40,303 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:40,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 12:36:40,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 12:36:40,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:36:40,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:36:40,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:40,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:36:40,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 12:36:40,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 12:36:40,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:40,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133667311] [2025-02-06 12:36:40,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133667311] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:40,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:36:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-02-06 12:36:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200494495] [2025-02-06 12:36:40,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:40,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:36:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:40,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:36:40,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:36:40,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:40,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 118 transitions, 1586 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:40,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:40,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:40,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:42,093 INFO L124 PetriNetUnfolderBase]: 1489/2846 cut-off events. [2025-02-06 12:36:42,094 INFO L125 PetriNetUnfolderBase]: For 90013/90019 co-relation queries the response was YES. [2025-02-06 12:36:42,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16233 conditions, 2846 events. 1489/2846 cut-off events. For 90013/90019 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 16187 event pairs, 310 based on Foata normal form. 87/2932 useless extension candidates. Maximal degree in co-relation 16169. Up to 1168 conditions per place. [2025-02-06 12:36:42,121 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 151 selfloop transitions, 64 changer transitions 105/324 dead transitions. [2025-02-06 12:36:42,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 324 transitions, 4728 flow [2025-02-06 12:36:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 12:36:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-02-06 12:36:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 496 transitions. [2025-02-06 12:36:42,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5182863113897597 [2025-02-06 12:36:42,130 INFO L175 Difference]: Start difference. First operand has 155 places, 118 transitions, 1586 flow. Second operand 33 states and 496 transitions. [2025-02-06 12:36:42,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 324 transitions, 4728 flow [2025-02-06 12:36:42,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 324 transitions, 4067 flow, removed 285 selfloop flow, removed 24 redundant places. [2025-02-06 12:36:42,257 INFO L231 Difference]: Finished difference. Result has 176 places, 144 transitions, 1978 flow [2025-02-06 12:36:42,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1978, PETRI_PLACES=176, PETRI_TRANSITIONS=144} [2025-02-06 12:36:42,258 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2025-02-06 12:36:42,258 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 144 transitions, 1978 flow [2025-02-06 12:36:42,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:42,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:42,259 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:42,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 12:36:42,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:42,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:42,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash -612340375, now seen corresponding path program 3 times [2025-02-06 12:36:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:42,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264860077] [2025-02-06 12:36:42,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:36:42,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:42,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:42,468 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:42,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 12:36:42,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-02-06 12:36:42,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:36:42,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 12:36:42,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:42,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:36:42,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:36:42,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:36:42,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:42,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264860077] [2025-02-06 12:36:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264860077] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:42,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:36:42,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-02-06 12:36:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690399811] [2025-02-06 12:36:42,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:42,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:36:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:42,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:36:42,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:36:42,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:42,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 144 transitions, 1978 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:42,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:42,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:42,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:44,732 INFO L124 PetriNetUnfolderBase]: 2119/4082 cut-off events. [2025-02-06 12:36:44,732 INFO L125 PetriNetUnfolderBase]: For 205191/205197 co-relation queries the response was YES. [2025-02-06 12:36:44,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28284 conditions, 4082 events. 2119/4082 cut-off events. For 205191/205197 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 24298 event pairs, 162 based on Foata normal form. 87/4168 useless extension candidates. Maximal degree in co-relation 28213. Up to 765 conditions per place. [2025-02-06 12:36:44,757 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 185 selfloop transitions, 121 changer transitions 91/401 dead transitions. [2025-02-06 12:36:44,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 401 transitions, 7055 flow [2025-02-06 12:36:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-06 12:36:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-02-06 12:36:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 602 transitions. [2025-02-06 12:36:44,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5322723253757736 [2025-02-06 12:36:44,762 INFO L175 Difference]: Start difference. First operand has 176 places, 144 transitions, 1978 flow. Second operand 39 states and 602 transitions. [2025-02-06 12:36:44,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 401 transitions, 7055 flow [2025-02-06 12:36:44,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 401 transitions, 5852 flow, removed 579 selfloop flow, removed 19 redundant places. [2025-02-06 12:36:44,909 INFO L231 Difference]: Finished difference. Result has 207 places, 183 transitions, 3122 flow [2025-02-06 12:36:44,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=3122, PETRI_PLACES=207, PETRI_TRANSITIONS=183} [2025-02-06 12:36:44,909 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2025-02-06 12:36:44,909 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 183 transitions, 3122 flow [2025-02-06 12:36:44,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:44,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:44,910 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:44,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 12:36:45,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:45,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:45,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1795207021, now seen corresponding path program 4 times [2025-02-06 12:36:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:45,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505639447] [2025-02-06 12:36:45,115 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:36:45,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:45,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:45,118 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:45,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 12:36:45,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-06 12:36:45,209 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:36:45,209 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:36:45,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:45,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:36:45,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 12:36:45,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 12:36:45,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505639447] [2025-02-06 12:36:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505639447] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:45,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:36:45,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-02-06 12:36:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998686703] [2025-02-06 12:36:45,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:36:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:45,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:36:45,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:36:45,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:45,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 183 transitions, 3122 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:45,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:45,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:45,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:47,547 INFO L124 PetriNetUnfolderBase]: 2173/4205 cut-off events. [2025-02-06 12:36:47,547 INFO L125 PetriNetUnfolderBase]: For 270287/270293 co-relation queries the response was YES. [2025-02-06 12:36:47,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30283 conditions, 4205 events. 2173/4205 cut-off events. For 270287/270293 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 24761 event pairs, 124 based on Foata normal form. 159/4363 useless extension candidates. Maximal degree in co-relation 30199. Up to 819 conditions per place. [2025-02-06 12:36:47,577 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 154 selfloop transitions, 146 changer transitions 133/437 dead transitions. [2025-02-06 12:36:47,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 437 transitions, 8340 flow [2025-02-06 12:36:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-06 12:36:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-02-06 12:36:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 611 transitions. [2025-02-06 12:36:47,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267241379310345 [2025-02-06 12:36:47,581 INFO L175 Difference]: Start difference. First operand has 207 places, 183 transitions, 3122 flow. Second operand 40 states and 611 transitions. [2025-02-06 12:36:47,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 437 transitions, 8340 flow [2025-02-06 12:36:48,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 437 transitions, 6915 flow, removed 687 selfloop flow, removed 19 redundant places. [2025-02-06 12:36:48,027 INFO L231 Difference]: Finished difference. Result has 241 places, 205 transitions, 3584 flow [2025-02-06 12:36:48,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3584, PETRI_PLACES=241, PETRI_TRANSITIONS=205} [2025-02-06 12:36:48,030 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2025-02-06 12:36:48,030 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 205 transitions, 3584 flow [2025-02-06 12:36:48,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:48,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:48,031 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:48,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 12:36:48,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:48,232 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 12:36:48,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash -890586342, now seen corresponding path program 5 times [2025-02-06 12:36:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:36:48,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669937262] [2025-02-06 12:36:48,237 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:36:48,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:36:48,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:36:48,239 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:36:48,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 12:36:48,274 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-02-06 12:36:48,286 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 12:36:48,287 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 12:36:48,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:48,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 12:36:48,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:36:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:48,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:36:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:36:48,748 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:36:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669937262] [2025-02-06 12:36:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669937262] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:36:48,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:36:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-02-06 12:36:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917251818] [2025-02-06 12:36:48,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:36:48,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 12:36:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:36:48,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 12:36:48,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-02-06 12:36:48,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-02-06 12:36:48,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 205 transitions, 3584 flow. Second operand has 25 states, 25 states have (on average 10.04) internal successors, (251), 25 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:48,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:48,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-02-06 12:36:48,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:51,060 INFO L124 PetriNetUnfolderBase]: 2281/4478 cut-off events. [2025-02-06 12:36:51,060 INFO L125 PetriNetUnfolderBase]: For 370625/370631 co-relation queries the response was YES. [2025-02-06 12:36:51,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34459 conditions, 4478 events. 2281/4478 cut-off events. For 370625/370631 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 26241 event pairs, 983 based on Foata normal form. 123/4600 useless extension candidates. Maximal degree in co-relation 34361. Up to 3096 conditions per place.