./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-misc-3.wvr.c -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 b2ed7b18db6948b1f53058568aeeb46b9da6de135bdadf46ddc91e86240dfa66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:37:22,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:37:22,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:37:22,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:37:22,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:37:22,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:37:22,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:37:22,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:37:22,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:37:22,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:37:22,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:37:22,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:37:22,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:37:22,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:37:22,862 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:37:22,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:37:22,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:37:22,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:37:22,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:37:22,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:37:22,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:37:22,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:37:22,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:37:22,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:37:22,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:37:22,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:37:22,864 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 -> b2ed7b18db6948b1f53058568aeeb46b9da6de135bdadf46ddc91e86240dfa66 [2025-02-08 08:37:23,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:37:23,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:37:23,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:37:23,077 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:37:23,077 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:37:23,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3.wvr.c [2025-02-08 08:37:24,187 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0f503f87/97f79c07102c48f3be3f8a9395e1b7c3/FLAG5c8fa4759 [2025-02-08 08:37:24,391 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:37:24,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3.wvr.c [2025-02-08 08:37:24,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0f503f87/97f79c07102c48f3be3f8a9395e1b7c3/FLAG5c8fa4759 [2025-02-08 08:37:24,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0f503f87/97f79c07102c48f3be3f8a9395e1b7c3 [2025-02-08 08:37:24,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:37:24,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:37:24,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:37:24,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:37:24,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:37:24,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa0cb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24, skipping insertion in model container [2025-02-08 08:37:24,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:37:24,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:37:24,898 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:37:24,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:37:24,927 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:37:24,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24 WrapperNode [2025-02-08 08:37:24,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:37:24,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:37:24,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:37:24,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:37:24,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,951 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-02-08 08:37:24,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:37:24,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:37:24,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:37:24,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:37:24,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,971 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:37:24,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:37:24,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:37:24,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:37:24,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:37:24,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (1/1) ... [2025-02-08 08:37:24,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:37:24,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:25,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:37:25,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:37:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:37:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:37:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:37:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:37:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:37:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:37:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:37:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:37:25,026 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:37:25,079 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:37:25,080 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:37:25,253 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:37:25,253 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:37:25,348 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:37:25,348 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:37:25,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:25 BoogieIcfgContainer [2025-02-08 08:37:25,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:37:25,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:37:25,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:37:25,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:37:25,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:37:24" (1/3) ... [2025-02-08 08:37:25,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301d4279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:37:25, skipping insertion in model container [2025-02-08 08:37:25,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:24" (2/3) ... [2025-02-08 08:37:25,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301d4279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:37:25, skipping insertion in model container [2025-02-08 08:37:25,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:25" (3/3) ... [2025-02-08 08:37:25,361 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2025-02-08 08:37:25,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:37:25,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3.wvr.c that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-08 08:37:25,372 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:37:25,424 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:37:25,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 78 flow [2025-02-08 08:37:25,480 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-02-08 08:37:25,482 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:37:25,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 4/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-08 08:37:25,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 78 flow [2025-02-08 08:37:25,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2025-02-08 08:37:25,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:37:25,504 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;@4c2d5179, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:37:25,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 08:37:25,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:37:25,517 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-02-08 08:37:25,517 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:37:25,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:25,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:25,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:25,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash -442696329, now seen corresponding path program 1 times [2025-02-08 08:37:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:25,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492436664] [2025-02-08 08:37:25,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:25,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:25,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:37:25,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:37:25,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492436664] [2025-02-08 08:37:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492436664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:25,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069084898] [2025-02-08 08:37:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:25,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:25,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:25,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:25,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:25,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-02-08 08:37:25,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:25,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:25,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-02-08 08:37:25,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:25,765 INFO L124 PetriNetUnfolderBase]: 146/284 cut-off events. [2025-02-08 08:37:25,765 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 08:37:25,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 284 events. 146/284 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1127 event pairs, 12 based on Foata normal form. 2/256 useless extension candidates. Maximal degree in co-relation 458. Up to 185 conditions per place. [2025-02-08 08:37:25,768 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 21 selfloop transitions, 5 changer transitions 1/38 dead transitions. [2025-02-08 08:37:25,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 151 flow [2025-02-08 08:37:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-02-08 08:37:25,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2025-02-08 08:37:25,778 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 70 flow. Second operand 3 states and 71 transitions. [2025-02-08 08:37:25,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 151 flow [2025-02-08 08:37:25,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 137 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:37:25,782 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 91 flow [2025-02-08 08:37:25,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2025-02-08 08:37:25,787 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2025-02-08 08:37:25,787 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 91 flow [2025-02-08 08:37:25,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:25,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:25,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:25,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:37:25,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:25,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1420721099, now seen corresponding path program 1 times [2025-02-08 08:37:25,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:25,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530779701] [2025-02-08 08:37:25,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:25,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:37:25,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:37:25,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:25,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:25,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530779701] [2025-02-08 08:37:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530779701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:25,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793840038] [2025-02-08 08:37:25,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:25,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:25,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:25,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:25,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:25,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-02-08 08:37:25,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:25,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:25,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-02-08 08:37:25,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:26,017 INFO L124 PetriNetUnfolderBase]: 152/299 cut-off events. [2025-02-08 08:37:26,017 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-08 08:37:26,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 299 events. 152/299 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1242 event pairs, 28 based on Foata normal form. 12/281 useless extension candidates. Maximal degree in co-relation 440. Up to 143 conditions per place. [2025-02-08 08:37:26,023 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 28 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-02-08 08:37:26,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 180 flow [2025-02-08 08:37:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-02-08 08:37:26,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-02-08 08:37:26,024 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 91 flow. Second operand 3 states and 69 transitions. [2025-02-08 08:37:26,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 180 flow [2025-02-08 08:37:26,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 173 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:26,026 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 96 flow [2025-02-08 08:37:26,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2025-02-08 08:37:26,026 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-02-08 08:37:26,026 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 96 flow [2025-02-08 08:37:26,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:26,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:26,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:37:26,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:26,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:26,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1464167604, now seen corresponding path program 1 times [2025-02-08 08:37:26,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:26,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379495355] [2025-02-08 08:37:26,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:26,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:26,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:37:26,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:37:26,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:26,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:26,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379495355] [2025-02-08 08:37:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379495355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:26,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:26,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017622887] [2025-02-08 08:37:26,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:26,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:26,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:26,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:26,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-02-08 08:37:26,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:26,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-02-08 08:37:26,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:26,157 INFO L124 PetriNetUnfolderBase]: 157/328 cut-off events. [2025-02-08 08:37:26,157 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-02-08 08:37:26,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 328 events. 157/328 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1549 event pairs, 34 based on Foata normal form. 15/294 useless extension candidates. Maximal degree in co-relation 425. Up to 144 conditions per place. [2025-02-08 08:37:26,162 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 29 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-02-08 08:37:26,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 194 flow [2025-02-08 08:37:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-08 08:37:26,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-02-08 08:37:26,162 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 96 flow. Second operand 3 states and 68 transitions. [2025-02-08 08:37:26,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 194 flow [2025-02-08 08:37:26,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:26,163 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 106 flow [2025-02-08 08:37:26,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2025-02-08 08:37:26,164 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-02-08 08:37:26,164 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 106 flow [2025-02-08 08:37:26,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:26,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:26,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:37:26,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:26,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1205709918, now seen corresponding path program 1 times [2025-02-08 08:37:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:26,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168517622] [2025-02-08 08:37:26,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:26,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:26,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:37:26,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:37:26,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:26,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168517622] [2025-02-08 08:37:26,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168517622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:26,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:26,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:37:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727807911] [2025-02-08 08:37:26,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:26,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:26,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:26,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:26,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 08:37:26,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:26,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 08:37:26,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:26,459 INFO L124 PetriNetUnfolderBase]: 326/601 cut-off events. [2025-02-08 08:37:26,460 INFO L125 PetriNetUnfolderBase]: For 214/238 co-relation queries the response was YES. [2025-02-08 08:37:26,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 601 events. 326/601 cut-off events. For 214/238 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2639 event pairs, 56 based on Foata normal form. 12/568 useless extension candidates. Maximal degree in co-relation 597. Up to 225 conditions per place. [2025-02-08 08:37:26,462 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 41 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-02-08 08:37:26,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 55 transitions, 272 flow [2025-02-08 08:37:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-02-08 08:37:26,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2025-02-08 08:37:26,463 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 106 flow. Second operand 4 states and 89 transitions. [2025-02-08 08:37:26,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 55 transitions, 272 flow [2025-02-08 08:37:26,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:26,468 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 136 flow [2025-02-08 08:37:26,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-02-08 08:37:26,468 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-02-08 08:37:26,468 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 136 flow [2025-02-08 08:37:26,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:26,469 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:26,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:37:26,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:26,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1824917204, now seen corresponding path program 1 times [2025-02-08 08:37:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:26,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453596840] [2025-02-08 08:37:26,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:26,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:37:26,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:37:26,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:26,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:37:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453596840] [2025-02-08 08:37:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453596840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:26,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:37:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815854303] [2025-02-08 08:37:26,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:26,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:26,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:26,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:26,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-08 08:37:26,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:26,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-08 08:37:26,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:26,597 INFO L124 PetriNetUnfolderBase]: 221/432 cut-off events. [2025-02-08 08:37:26,597 INFO L125 PetriNetUnfolderBase]: For 433/455 co-relation queries the response was YES. [2025-02-08 08:37:26,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 432 events. 221/432 cut-off events. For 433/455 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2035 event pairs, 48 based on Foata normal form. 21/429 useless extension candidates. Maximal degree in co-relation 627. Up to 237 conditions per place. [2025-02-08 08:37:26,600 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 31 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-02-08 08:37:26,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 250 flow [2025-02-08 08:37:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-02-08 08:37:26,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-02-08 08:37:26,601 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 136 flow. Second operand 3 states and 65 transitions. [2025-02-08 08:37:26,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 250 flow [2025-02-08 08:37:26,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 246 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-08 08:37:26,604 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 138 flow [2025-02-08 08:37:26,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-02-08 08:37:26,605 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2025-02-08 08:37:26,605 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 138 flow [2025-02-08 08:37:26,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:26,606 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:26,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:37:26,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:26,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 633392308, now seen corresponding path program 1 times [2025-02-08 08:37:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:26,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760556042] [2025-02-08 08:37:26,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:26,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:37:26,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:37:26,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:26,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 08:37:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:26,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760556042] [2025-02-08 08:37:26,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760556042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:26,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:26,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:37:26,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267183781] [2025-02-08 08:37:26,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:26,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:26,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:26,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:26,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:26,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 08:37:26,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:26,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 08:37:26,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:26,854 INFO L124 PetriNetUnfolderBase]: 450/786 cut-off events. [2025-02-08 08:37:26,854 INFO L125 PetriNetUnfolderBase]: For 793/843 co-relation queries the response was YES. [2025-02-08 08:37:26,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 786 events. 450/786 cut-off events. For 793/843 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3930 event pairs, 122 based on Foata normal form. 44/807 useless extension candidates. Maximal degree in co-relation 1213. Up to 286 conditions per place. [2025-02-08 08:37:26,857 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 44 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-02-08 08:37:26,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 352 flow [2025-02-08 08:37:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-02-08 08:37:26,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671875 [2025-02-08 08:37:26,860 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 138 flow. Second operand 4 states and 86 transitions. [2025-02-08 08:37:26,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 352 flow [2025-02-08 08:37:26,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:26,862 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 164 flow [2025-02-08 08:37:26,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-02-08 08:37:26,862 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2025-02-08 08:37:26,862 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 164 flow [2025-02-08 08:37:26,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:26,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:26,863 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:26,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:37:26,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:26,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1872455126, now seen corresponding path program 1 times [2025-02-08 08:37:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:26,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944081285] [2025-02-08 08:37:26,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:26,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 08:37:26,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:37:26,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:26,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:26,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944081285] [2025-02-08 08:37:26,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944081285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:26,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223757484] [2025-02-08 08:37:26,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:26,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:26,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:37:26,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:37:27,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 08:37:27,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:37:27,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:27,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:27,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:37:27,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:27,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:27,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223757484] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:27,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:27,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-08 08:37:27,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548609752] [2025-02-08 08:37:27,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:27,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:37:27,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:27,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:37:27,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:37:27,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-02-08 08:37:27,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:27,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:27,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-02-08 08:37:27,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:27,350 INFO L124 PetriNetUnfolderBase]: 956/1991 cut-off events. [2025-02-08 08:37:27,350 INFO L125 PetriNetUnfolderBase]: For 2226/2331 co-relation queries the response was YES. [2025-02-08 08:37:27,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 1991 events. 956/1991 cut-off events. For 2226/2331 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 11842 event pairs, 145 based on Foata normal form. 40/1995 useless extension candidates. Maximal degree in co-relation 1526. Up to 658 conditions per place. [2025-02-08 08:37:27,360 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 65 selfloop transitions, 15 changer transitions 1/94 dead transitions. [2025-02-08 08:37:27,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 602 flow [2025-02-08 08:37:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:37:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:37:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-02-08 08:37:27,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-02-08 08:37:27,362 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 164 flow. Second operand 5 states and 128 transitions. [2025-02-08 08:37:27,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 602 flow [2025-02-08 08:37:27,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 94 transitions, 594 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-02-08 08:37:27,366 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 259 flow [2025-02-08 08:37:27,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2025-02-08 08:37:27,368 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2025-02-08 08:37:27,368 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 259 flow [2025-02-08 08:37:27,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:27,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:27,368 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:27,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:37:27,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:27,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:27,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1535686436, now seen corresponding path program 2 times [2025-02-08 08:37:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:27,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419337416] [2025-02-08 08:37:27,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:37:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:27,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 08:37:27,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:37:27,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:37:27,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:27,723 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-08 08:37:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419337416] [2025-02-08 08:37:27,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419337416] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043504892] [2025-02-08 08:37:27,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:37:27,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:27,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:27,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:37:27,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:37:27,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 08:37:27,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:37:27,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:37:27,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:27,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:37:27,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:27,827 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-08 08:37:27,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:27,862 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-08 08:37:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043504892] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:27,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:27,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-08 08:37:27,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030163765] [2025-02-08 08:37:27,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:27,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:37:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:27,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:37:27,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:37:27,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2025-02-08 08:37:27,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:27,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:27,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2025-02-08 08:37:27,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:28,291 INFO L124 PetriNetUnfolderBase]: 1767/3686 cut-off events. [2025-02-08 08:37:28,292 INFO L125 PetriNetUnfolderBase]: For 5744/5976 co-relation queries the response was YES. [2025-02-08 08:37:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11566 conditions, 3686 events. 1767/3686 cut-off events. For 5744/5976 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 25954 event pairs, 177 based on Foata normal form. 94/3710 useless extension candidates. Maximal degree in co-relation 3683. Up to 1033 conditions per place. [2025-02-08 08:37:28,314 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 81 selfloop transitions, 31 changer transitions 1/126 dead transitions. [2025-02-08 08:37:28,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 126 transitions, 889 flow [2025-02-08 08:37:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:37:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:37:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-02-08 08:37:28,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8125 [2025-02-08 08:37:28,315 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 259 flow. Second operand 6 states and 156 transitions. [2025-02-08 08:37:28,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 126 transitions, 889 flow [2025-02-08 08:37:28,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 126 transitions, 833 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-02-08 08:37:28,321 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 386 flow [2025-02-08 08:37:28,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=53, PETRI_TRANSITIONS=65} [2025-02-08 08:37:28,322 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2025-02-08 08:37:28,322 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 386 flow [2025-02-08 08:37:28,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:28,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:28,322 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:28,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:37:28,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:28,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:28,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1842400662, now seen corresponding path program 3 times [2025-02-08 08:37:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:28,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249081743] [2025-02-08 08:37:28,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:37:28,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:28,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:37:28,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:37:28,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:37:28,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:28,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249081743] [2025-02-08 08:37:28,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249081743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765307252] [2025-02-08 08:37:28,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:37:28,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:28,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:28,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:37:28,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:37:28,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:37:28,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:37:28,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:37:28,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:28,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:37:28,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:37:29,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:37:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765307252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:29,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:37:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 14 [2025-02-08 08:37:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258798064] [2025-02-08 08:37:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:37:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:29,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:37:29,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:37:29,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 08:37:29,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 65 transitions, 386 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:29,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:29,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 08:37:29,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:29,868 INFO L124 PetriNetUnfolderBase]: 5163/8638 cut-off events. [2025-02-08 08:37:29,868 INFO L125 PetriNetUnfolderBase]: For 11235/11235 co-relation queries the response was YES. [2025-02-08 08:37:29,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27624 conditions, 8638 events. 5163/8638 cut-off events. For 11235/11235 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 53513 event pairs, 603 based on Foata normal form. 156/8783 useless extension candidates. Maximal degree in co-relation 11442. Up to 2441 conditions per place. [2025-02-08 08:37:29,910 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 155 selfloop transitions, 37 changer transitions 0/199 dead transitions. [2025-02-08 08:37:29,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1540 flow [2025-02-08 08:37:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:37:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:37:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2025-02-08 08:37:29,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51875 [2025-02-08 08:37:29,912 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 386 flow. Second operand 10 states and 166 transitions. [2025-02-08 08:37:29,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1540 flow [2025-02-08 08:37:29,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 199 transitions, 1459 flow, removed 29 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:29,923 INFO L231 Difference]: Finished difference. Result has 67 places, 92 transitions, 654 flow [2025-02-08 08:37:29,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=654, PETRI_PLACES=67, PETRI_TRANSITIONS=92} [2025-02-08 08:37:29,924 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2025-02-08 08:37:29,924 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 92 transitions, 654 flow [2025-02-08 08:37:29,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:29,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:29,925 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:29,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:37:30,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:30,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:30,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash -346361226, now seen corresponding path program 4 times [2025-02-08 08:37:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:30,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595412765] [2025-02-08 08:37:30,130 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:37:30,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:30,136 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:37:30,144 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:37:30,144 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:37:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:37:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:30,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595412765] [2025-02-08 08:37:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595412765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:30,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:30,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:37:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635229823] [2025-02-08 08:37:30,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:30,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:30,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:30,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:30,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 08:37:30,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 92 transitions, 654 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:30,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:30,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 08:37:30,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:30,579 INFO L124 PetriNetUnfolderBase]: 2660/5066 cut-off events. [2025-02-08 08:37:30,579 INFO L125 PetriNetUnfolderBase]: For 16268/16372 co-relation queries the response was YES. [2025-02-08 08:37:30,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19198 conditions, 5066 events. 2660/5066 cut-off events. For 16268/16372 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 34290 event pairs, 832 based on Foata normal form. 424/5372 useless extension candidates. Maximal degree in co-relation 14711. Up to 2445 conditions per place. [2025-02-08 08:37:30,605 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 86 selfloop transitions, 9 changer transitions 0/111 dead transitions. [2025-02-08 08:37:30,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 111 transitions, 958 flow [2025-02-08 08:37:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-02-08 08:37:30,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2025-02-08 08:37:30,606 INFO L175 Difference]: Start difference. First operand has 67 places, 92 transitions, 654 flow. Second operand 4 states and 75 transitions. [2025-02-08 08:37:30,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 111 transitions, 958 flow [2025-02-08 08:37:30,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 111 transitions, 939 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 08:37:30,629 INFO L231 Difference]: Finished difference. Result has 69 places, 88 transitions, 638 flow [2025-02-08 08:37:30,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=638, PETRI_PLACES=69, PETRI_TRANSITIONS=88} [2025-02-08 08:37:30,630 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2025-02-08 08:37:30,630 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 88 transitions, 638 flow [2025-02-08 08:37:30,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:30,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:30,630 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:30,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:37:30,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:30,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1855005011, now seen corresponding path program 5 times [2025-02-08 08:37:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:30,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27908937] [2025-02-08 08:37:30,632 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:37:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:30,640 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-02-08 08:37:30,656 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 08:37:30,657 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 08:37:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:37:30,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27908937] [2025-02-08 08:37:30,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27908937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878272695] [2025-02-08 08:37:30,899 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:37:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:30,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:30,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:37:30,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:37:30,936 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 3 equivalence classes. [2025-02-08 08:37:30,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 08:37:30,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 08:37:30,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:30,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:37:30,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:37:31,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:37:31,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878272695] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:31,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:37:31,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 12 [2025-02-08 08:37:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716544935] [2025-02-08 08:37:31,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:31,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:31,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:31,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:37:31,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 08:37:31,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 88 transitions, 638 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:31,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:31,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 08:37:31,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:31,645 INFO L124 PetriNetUnfolderBase]: 3187/6120 cut-off events. [2025-02-08 08:37:31,645 INFO L125 PetriNetUnfolderBase]: For 19362/19526 co-relation queries the response was YES. [2025-02-08 08:37:31,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24370 conditions, 6120 events. 3187/6120 cut-off events. For 19362/19526 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 41434 event pairs, 661 based on Foata normal form. 175/6267 useless extension candidates. Maximal degree in co-relation 20316. Up to 2703 conditions per place. [2025-02-08 08:37:31,670 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 104 selfloop transitions, 27 changer transitions 0/143 dead transitions. [2025-02-08 08:37:31,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 143 transitions, 1280 flow [2025-02-08 08:37:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-02-08 08:37:31,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-02-08 08:37:31,671 INFO L175 Difference]: Start difference. First operand has 69 places, 88 transitions, 638 flow. Second operand 4 states and 82 transitions. [2025-02-08 08:37:31,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 143 transitions, 1280 flow [2025-02-08 08:37:31,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 143 transitions, 1255 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 08:37:31,706 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 792 flow [2025-02-08 08:37:31,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=792, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2025-02-08 08:37:31,707 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2025-02-08 08:37:31,707 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 792 flow [2025-02-08 08:37:31,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:31,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:31,707 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:31,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:37:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 08:37:31,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 08:37:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1681972231, now seen corresponding path program 6 times [2025-02-08 08:37:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796318222] [2025-02-08 08:37:31,908 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:37:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:31,914 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-02-08 08:37:31,918 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 36 statements. [2025-02-08 08:37:31,919 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:37:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:37:31,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796318222] [2025-02-08 08:37:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796318222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:31,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:31,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:37:31,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154520268] [2025-02-08 08:37:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:31,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:31,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:31,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:31,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 08:37:31,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 792 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:31,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:31,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 08:37:31,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:32,080 INFO L124 PetriNetUnfolderBase]: 767/1633 cut-off events. [2025-02-08 08:37:32,080 INFO L125 PetriNetUnfolderBase]: For 7751/7791 co-relation queries the response was YES. [2025-02-08 08:37:32,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7005 conditions, 1633 events. 767/1633 cut-off events. For 7751/7791 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9240 event pairs, 279 based on Foata normal form. 100/1714 useless extension candidates. Maximal degree in co-relation 5559. Up to 661 conditions per place. [2025-02-08 08:37:32,084 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 0 selfloop transitions, 0 changer transitions 91/91 dead transitions. [2025-02-08 08:37:32,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 906 flow [2025-02-08 08:37:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-02-08 08:37:32,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2025-02-08 08:37:32,085 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 792 flow. Second operand 4 states and 75 transitions. [2025-02-08 08:37:32,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 906 flow [2025-02-08 08:37:32,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 873 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 08:37:32,094 INFO L231 Difference]: Finished difference. Result has 69 places, 0 transitions, 0 flow [2025-02-08 08:37:32,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=69, PETRI_TRANSITIONS=0} [2025-02-08 08:37:32,095 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2025-02-08 08:37:32,095 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 0 transitions, 0 flow [2025-02-08 08:37:32,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:32,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-02-08 08:37:32,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-02-08 08:37:32,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 08:37:32,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-08 08:37:32,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:37:32,097 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:32,100 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:37:32,100 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:37:32,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:37:32 BasicIcfg [2025-02-08 08:37:32,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:37:32,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:37:32,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:37:32,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:37:32,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:25" (3/4) ... [2025-02-08 08:37:32,106 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:37:32,108 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:37:32,108 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:37:32,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-02-08 08:37:32,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-08 08:37:32,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 08:37:32,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:37:32,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:37:32,159 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:37:32,159 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:37:32,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:37:32,160 INFO L158 Benchmark]: Toolchain (without parser) took 7405.74ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 124.3MB in the beginning and 284.1MB in the end (delta: -159.9MB). Peak memory consumption was 230.5MB. Max. memory is 16.1GB. [2025-02-08 08:37:32,161 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:37:32,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.61ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 113.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:32,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.74ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 112.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:37:32,162 INFO L158 Benchmark]: Boogie Preprocessor took 25.80ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.0MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:32,162 INFO L158 Benchmark]: IcfgBuilder took 370.42ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 88.1MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:37:32,163 INFO L158 Benchmark]: TraceAbstraction took 6753.60ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 88.1MB in the beginning and 288.3MB in the end (delta: -200.2MB). Peak memory consumption was 197.0MB. Max. memory is 16.1GB. [2025-02-08 08:37:32,163 INFO L158 Benchmark]: Witness Printer took 55.47ms. Allocated memory is still 562.0MB. Free memory was 288.3MB in the beginning and 284.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:37:32,164 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.20ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.61ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 113.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.74ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 112.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.80ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.0MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 370.42ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 88.1MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6753.60ms. Allocated memory was 167.8MB in the beginning and 562.0MB in the end (delta: 394.3MB). Free memory was 88.1MB in the beginning and 288.3MB in the end (delta: -200.2MB). Peak memory consumption was 197.0MB. Max. memory is 16.1GB. * Witness Printer took 55.47ms. Allocated memory is still 562.0MB. Free memory was 288.3MB in the beginning and 284.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 75]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 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: 6.7s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 847 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 15 mSDtfsCounter, 847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=792occurred in iteration=11, InterpolantAutomatonStates: 53, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 461 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 2131 SizeOfPredicates, 15 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 44/84 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:37:32,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE