./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:15:35,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:15:35,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:15:35,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:15:35,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:15:35,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:15:35,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:15:35,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:15:35,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:15:35,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:15:35,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:15:35,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:15:35,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:15:35,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:15:35,254 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:15:35,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:15:35,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:15:35,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:15:35,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:15:35,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:15:35,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:15:35,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:15:35,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:15:35,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-02-06 13:15:35,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:15:35,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:15:35,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:15:35,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:15:35,581 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:15:35,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-02-06 13:15:36,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2c854660/baded3eaa8cb4d7b8ca683d882906d69/FLAG40eccbb8a [2025-02-06 13:15:37,382 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:15:37,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-02-06 13:15:37,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2c854660/baded3eaa8cb4d7b8ca683d882906d69/FLAG40eccbb8a [2025-02-06 13:15:37,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2c854660/baded3eaa8cb4d7b8ca683d882906d69 [2025-02-06 13:15:37,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:15:37,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:15:37,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:15:37,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:15:37,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:15:37,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9833b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37, skipping insertion in model container [2025-02-06 13:15:37,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:15:37,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:15:37,708 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:15:37,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:15:37,784 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:15:37,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37 WrapperNode [2025-02-06 13:15:37,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:15:37,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:15:37,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:15:37,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:15:37,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,816 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 53 [2025-02-06 13:15:37,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:15:37,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:15:37,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:15:37,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:15:37,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,847 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:15:37,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:15:37,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:15:37,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:15:37,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:15:37,861 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (1/1) ... [2025-02-06 13:15:37,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:15:37,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:37,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:15:37,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:15:37,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:15:37,923 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-06 13:15:37,923 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-06 13:15:37,923 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-06 13:15:37,923 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-06 13:15:37,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:15:37,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:15:37,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:15:37,924 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:15:38,025 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:15:38,027 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:15:38,181 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:15:38,181 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:15:38,274 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:15:38,275 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:15:38,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:38 BoogieIcfgContainer [2025-02-06 13:15:38,275 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:15:38,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:15:38,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:15:38,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:15:38,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:15:37" (1/3) ... [2025-02-06 13:15:38,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e35562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:15:38, skipping insertion in model container [2025-02-06 13:15:38,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:37" (2/3) ... [2025-02-06 13:15:38,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e35562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:15:38, skipping insertion in model container [2025-02-06 13:15:38,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:38" (3/3) ... [2025-02-06 13:15:38,291 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-02-06 13:15:38,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:15:38,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-06 13:15:38,314 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:15:38,368 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:15:38,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2025-02-06 13:15:38,431 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-02-06 13:15:38,433 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:15:38,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-02-06 13:15:38,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2025-02-06 13:15:38,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-02-06 13:15:38,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:15:38,461 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;@69caae02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:15:38,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 13:15:38,475 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:15:38,477 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-02-06 13:15:38,477 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:15:38,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:38,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:38,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:38,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 118860338, now seen corresponding path program 1 times [2025-02-06 13:15:38,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:38,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970942476] [2025-02-06 13:15:38,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:38,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:15:38,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:15:38,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:38,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:38,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970942476] [2025-02-06 13:15:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970942476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:38,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:38,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:15:38,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56981910] [2025-02-06 13:15:38,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:38,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:15:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:38,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:15:38,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:15:38,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:15:38,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:38,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:38,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:15:38,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:39,189 INFO L124 PetriNetUnfolderBase]: 203/376 cut-off events. [2025-02-06 13:15:39,189 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 13:15:39,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 376 events. 203/376 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1452 event pairs, 83 based on Foata normal form. 26/341 useless extension candidates. Maximal degree in co-relation 684. Up to 187 conditions per place. [2025-02-06 13:15:39,194 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2025-02-06 13:15:39,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 224 flow [2025-02-06 13:15:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:15:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:15:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-02-06 13:15:39,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 13:15:39,211 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 6 states and 87 transitions. [2025-02-06 13:15:39,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 224 flow [2025-02-06 13:15:39,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:15:39,221 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 91 flow [2025-02-06 13:15:39,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-02-06 13:15:39,229 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2025-02-06 13:15:39,229 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 91 flow [2025-02-06 13:15:39,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:39,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:39,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:39,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:15:39,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:39,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash -611282715, now seen corresponding path program 1 times [2025-02-06 13:15:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:39,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834716661] [2025-02-06 13:15:39,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:39,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:15:39,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:15:39,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:39,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834716661] [2025-02-06 13:15:39,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834716661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:39,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:39,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:15:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465845159] [2025-02-06 13:15:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:39,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:15:39,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:39,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:15:39,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:15:39,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-06 13:15:39,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:39,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:39,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-06 13:15:39,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:39,550 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2025-02-06 13:15:39,550 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-02-06 13:15:39,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 247 events. 111/247 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 940 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 312. Up to 97 conditions per place. [2025-02-06 13:15:39,555 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-02-06 13:15:39,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 228 flow [2025-02-06 13:15:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:15:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:15:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-02-06 13:15:39,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-02-06 13:15:39,558 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 91 flow. Second operand 5 states and 73 transitions. [2025-02-06 13:15:39,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 228 flow [2025-02-06 13:15:39,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:15:39,565 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 127 flow [2025-02-06 13:15:39,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-06 13:15:39,566 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2025-02-06 13:15:39,566 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 127 flow [2025-02-06 13:15:39,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:39,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:39,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:39,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:15:39,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:39,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1592092753, now seen corresponding path program 1 times [2025-02-06 13:15:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096008511] [2025-02-06 13:15:39,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:39,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:15:39,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:15:39,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:39,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:39,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096008511] [2025-02-06 13:15:39,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096008511] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:15:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230521948] [2025-02-06 13:15:39,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:39,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:39,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:15:39,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:15:39,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:15:39,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:39,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:39,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:15:39,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:15:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:39,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:15:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230521948] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:15:40,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:15:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 13:15:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784284739] [2025-02-06 13:15:40,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:15:40,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:15:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:40,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:15:40,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:15:40,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:15:40,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 127 flow. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:40,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:40,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:15:40,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:40,361 INFO L124 PetriNetUnfolderBase]: 140/279 cut-off events. [2025-02-06 13:15:40,363 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-02-06 13:15:40,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 279 events. 140/279 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 902 event pairs, 21 based on Foata normal form. 5/267 useless extension candidates. Maximal degree in co-relation 458. Up to 65 conditions per place. [2025-02-06 13:15:40,368 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 48 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2025-02-06 13:15:40,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 376 flow [2025-02-06 13:15:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:15:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 13:15:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2025-02-06 13:15:40,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3952254641909814 [2025-02-06 13:15:40,370 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 127 flow. Second operand 13 states and 149 transitions. [2025-02-06 13:15:40,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 376 flow [2025-02-06 13:15:40,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:15:40,377 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 212 flow [2025-02-06 13:15:40,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2025-02-06 13:15:40,379 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2025-02-06 13:15:40,379 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 212 flow [2025-02-06 13:15:40,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:40,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:40,380 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:40,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:15:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:40,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1690350616, now seen corresponding path program 2 times [2025-02-06 13:15:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600177938] [2025-02-06 13:15:40,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:15:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:40,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 13:15:40,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:15:40,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:15:40,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:40,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:40,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600177938] [2025-02-06 13:15:40,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600177938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:15:40,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389807193] [2025-02-06 13:15:40,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:15:40,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:40,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:40,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:40,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:15:40,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 13:15:40,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:15:40,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:15:40,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:15:40,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:15:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:41,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:15:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389807193] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:15:41,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:15:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-06 13:15:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814287188] [2025-02-06 13:15:41,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:15:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:15:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:41,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:15:41,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:15:41,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:15:41,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 212 flow. Second operand has 21 states, 21 states have (on average 7.619047619047619) internal successors, (160), 21 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:41,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:41,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:15:41,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:41,631 INFO L124 PetriNetUnfolderBase]: 260/537 cut-off events. [2025-02-06 13:15:41,631 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2025-02-06 13:15:41,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 537 events. 260/537 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2108 event pairs, 40 based on Foata normal form. 30/555 useless extension candidates. Maximal degree in co-relation 1375. Up to 104 conditions per place. [2025-02-06 13:15:41,637 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 93 selfloop transitions, 31 changer transitions 0/128 dead transitions. [2025-02-06 13:15:41,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 799 flow [2025-02-06 13:15:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 13:15:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 13:15:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 253 transitions. [2025-02-06 13:15:41,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4154351395730706 [2025-02-06 13:15:41,643 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 212 flow. Second operand 21 states and 253 transitions. [2025-02-06 13:15:41,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 799 flow [2025-02-06 13:15:41,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 128 transitions, 713 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-02-06 13:15:41,658 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 379 flow [2025-02-06 13:15:41,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=379, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-02-06 13:15:41,660 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2025-02-06 13:15:41,660 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 379 flow [2025-02-06 13:15:41,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.619047619047619) internal successors, (160), 21 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:41,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:41,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:41,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:15:41,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:41,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:41,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1228075413, now seen corresponding path program 1 times [2025-02-06 13:15:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238721171] [2025-02-06 13:15:41,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:41,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:15:41,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:15:41,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:41,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:41,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238721171] [2025-02-06 13:15:41,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238721171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:15:41,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:15:41,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:15:41,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606113708] [2025-02-06 13:15:41,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:15:41,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:15:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:41,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:15:41,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:15:41,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:15:41,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:41,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:41,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:15:41,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:41,974 INFO L124 PetriNetUnfolderBase]: 206/470 cut-off events. [2025-02-06 13:15:41,975 INFO L125 PetriNetUnfolderBase]: For 583/583 co-relation queries the response was YES. [2025-02-06 13:15:41,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 470 events. 206/470 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1959 event pairs, 181 based on Foata normal form. 8/468 useless extension candidates. Maximal degree in co-relation 1455. Up to 409 conditions per place. [2025-02-06 13:15:41,979 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 25 selfloop transitions, 1 changer transitions 26/55 dead transitions. [2025-02-06 13:15:41,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 475 flow [2025-02-06 13:15:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:15:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:15:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-02-06 13:15:41,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2025-02-06 13:15:41,980 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 379 flow. Second operand 3 states and 37 transitions. [2025-02-06 13:15:41,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 475 flow [2025-02-06 13:15:41,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 362 flow, removed 41 selfloop flow, removed 10 redundant places. [2025-02-06 13:15:41,991 INFO L231 Difference]: Finished difference. Result has 60 places, 29 transitions, 117 flow [2025-02-06 13:15:41,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=60, PETRI_TRANSITIONS=29} [2025-02-06 13:15:41,992 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2025-02-06 13:15:41,992 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 29 transitions, 117 flow [2025-02-06 13:15:41,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:41,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:41,993 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:41,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:15:41,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:41,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2003245432, now seen corresponding path program 3 times [2025-02-06 13:15:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:41,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951429718] [2025-02-06 13:15:41,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:15:41,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:42,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-02-06 13:15:42,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 22 statements. [2025-02-06 13:15:42,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:15:42,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:15:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:42,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951429718] [2025-02-06 13:15:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951429718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:15:42,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054147029] [2025-02-06 13:15:42,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:15:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:42,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:42,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:42,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:15:42,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-02-06 13:15:42,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 22 statements. [2025-02-06 13:15:42,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:15:42,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:42,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:15:42,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:15:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:15:42,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:15:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 13:15:42,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054147029] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:15:42,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:15:42,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-06 13:15:42,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257400503] [2025-02-06 13:15:42,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:15:42,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:15:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:42,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:15:42,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:15:42,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:15:42,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 29 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:42,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:42,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:15:42,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:42,376 INFO L124 PetriNetUnfolderBase]: 166/346 cut-off events. [2025-02-06 13:15:42,376 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2025-02-06 13:15:42,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 346 events. 166/346 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1136 event pairs, 54 based on Foata normal form. 5/347 useless extension candidates. Maximal degree in co-relation 902. Up to 151 conditions per place. [2025-02-06 13:15:42,381 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 25 selfloop transitions, 2 changer transitions 31/60 dead transitions. [2025-02-06 13:15:42,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 333 flow [2025-02-06 13:15:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:15:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 13:15:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-02-06 13:15:42,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4039408866995074 [2025-02-06 13:15:42,383 INFO L175 Difference]: Start difference. First operand has 60 places, 29 transitions, 117 flow. Second operand 7 states and 82 transitions. [2025-02-06 13:15:42,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 333 flow [2025-02-06 13:15:42,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 277 flow, removed 19 selfloop flow, removed 11 redundant places. [2025-02-06 13:15:42,385 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 82 flow [2025-02-06 13:15:42,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2025-02-06 13:15:42,388 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2025-02-06 13:15:42,389 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 82 flow [2025-02-06 13:15:42,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:42,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:42,389 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:42,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:15:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:42,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:42,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash 784115334, now seen corresponding path program 1 times [2025-02-06 13:15:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:42,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234408101] [2025-02-06 13:15:42,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:42,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:15:42,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:15:42,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:42,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234408101] [2025-02-06 13:15:42,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234408101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:15:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213789479] [2025-02-06 13:15:42,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:15:42,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:42,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:42,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:15:42,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:15:42,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:15:42,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:15:42,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:42,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:15:42,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:15:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:43,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:15:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213789479] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:15:43,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:15:43,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2025-02-06 13:15:43,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803526729] [2025-02-06 13:15:43,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:15:43,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-06 13:15:43,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:43,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-06 13:15:43,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 13:15:43,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-06 13:15:43,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 82 flow. Second operand has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:43,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:43,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-06 13:15:43,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:44,083 INFO L124 PetriNetUnfolderBase]: 142/299 cut-off events. [2025-02-06 13:15:44,083 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-06 13:15:44,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 299 events. 142/299 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 692 event pairs, 15 based on Foata normal form. 60/359 useless extension candidates. Maximal degree in co-relation 769. Up to 76 conditions per place. [2025-02-06 13:15:44,086 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 80 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2025-02-06 13:15:44,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 525 flow [2025-02-06 13:15:44,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 13:15:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-06 13:15:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 299 transitions. [2025-02-06 13:15:44,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2025-02-06 13:15:44,104 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 82 flow. Second operand 26 states and 299 transitions. [2025-02-06 13:15:44,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 525 flow [2025-02-06 13:15:44,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 107 transitions, 511 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-06 13:15:44,107 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 240 flow [2025-02-06 13:15:44,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=240, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2025-02-06 13:15:44,108 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2025-02-06 13:15:44,108 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 240 flow [2025-02-06 13:15:44,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:44,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:44,109 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:44,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 13:15:44,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 13:15:44,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:44,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1675650758, now seen corresponding path program 2 times [2025-02-06 13:15:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:44,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635231784] [2025-02-06 13:15:44,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:15:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:44,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 13:15:44,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:15:44,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:15:44,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:44,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:44,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635231784] [2025-02-06 13:15:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635231784] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:15:44,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050793562] [2025-02-06 13:15:44,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:15:44,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:44,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:44,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:44,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:15:44,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 13:15:44,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:15:44,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:15:44,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:44,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 13:15:44,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:15:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:45,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:15:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050793562] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:15:46,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:15:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-02-06 13:15:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378989680] [2025-02-06 13:15:46,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:15:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-02-06 13:15:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:46,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-02-06 13:15:46,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2025-02-06 13:15:46,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:15:46,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 240 flow. Second operand has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:46,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:46,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:15:46,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:15:49,089 INFO L124 PetriNetUnfolderBase]: 262/539 cut-off events. [2025-02-06 13:15:49,089 INFO L125 PetriNetUnfolderBase]: For 8312/8312 co-relation queries the response was YES. [2025-02-06 13:15:49,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 539 events. 262/539 cut-off events. For 8312/8312 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1251 event pairs, 15 based on Foata normal form. 120/659 useless extension candidates. Maximal degree in co-relation 1825. Up to 196 conditions per place. [2025-02-06 13:15:49,095 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 152 selfloop transitions, 49 changer transitions 0/203 dead transitions. [2025-02-06 13:15:49,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 1163 flow [2025-02-06 13:15:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-06 13:15:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-02-06 13:15:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 525 transitions. [2025-02-06 13:15:49,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2025-02-06 13:15:49,099 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 240 flow. Second operand 50 states and 525 transitions. [2025-02-06 13:15:49,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 1163 flow [2025-02-06 13:15:49,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 203 transitions, 1015 flow, removed 61 selfloop flow, removed 13 redundant places. [2025-02-06 13:15:49,109 INFO L231 Difference]: Finished difference. Result has 128 places, 62 transitions, 480 flow [2025-02-06 13:15:49,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=480, PETRI_PLACES=128, PETRI_TRANSITIONS=62} [2025-02-06 13:15:49,110 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2025-02-06 13:15:49,110 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 62 transitions, 480 flow [2025-02-06 13:15:49,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:49,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:15:49,111 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:15:49,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:15:49,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:49,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:15:49,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:15:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash -467876026, now seen corresponding path program 3 times [2025-02-06 13:15:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:15:49,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444436822] [2025-02-06 13:15:49,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:15:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:15:49,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 24 equivalence classes. [2025-02-06 13:15:49,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:15:49,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-02-06 13:15:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:50,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:15:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444436822] [2025-02-06 13:15:50,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444436822] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:15:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710089233] [2025-02-06 13:15:50,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:15:50,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:15:50,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:15:50,766 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:15:50,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:15:50,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 24 equivalence classes. [2025-02-06 13:15:50,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:15:50,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-02-06 13:15:50,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:15:50,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 13:15:50,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:15:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:52,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:15:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:15:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710089233] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:15:56,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:15:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-02-06 13:15:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961752126] [2025-02-06 13:15:56,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:15:56,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2025-02-06 13:15:56,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:15:56,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2025-02-06 13:15:56,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2025-02-06 13:15:56,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:15:56,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 62 transitions, 480 flow. Second operand has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:15:56,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:15:56,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:15:56,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:02,762 INFO L124 PetriNetUnfolderBase]: 502/1019 cut-off events. [2025-02-06 13:16:02,763 INFO L125 PetriNetUnfolderBase]: For 154388/154388 co-relation queries the response was YES. [2025-02-06 13:16:02,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1019 events. 502/1019 cut-off events. For 154388/154388 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2371 event pairs, 15 based on Foata normal form. 240/1259 useless extension candidates. Maximal degree in co-relation 3625. Up to 376 conditions per place. [2025-02-06 13:16:02,770 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 296 selfloop transitions, 97 changer transitions 0/395 dead transitions. [2025-02-06 13:16:02,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 395 transitions, 2315 flow [2025-02-06 13:16:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-02-06 13:16:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2025-02-06 13:16:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1029 transitions. [2025-02-06 13:16:02,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2025-02-06 13:16:02,774 INFO L175 Difference]: Start difference. First operand has 128 places, 62 transitions, 480 flow. Second operand 98 states and 1029 transitions. [2025-02-06 13:16:02,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 395 transitions, 2315 flow [2025-02-06 13:16:02,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 395 transitions, 2023 flow, removed 121 selfloop flow, removed 25 redundant places. [2025-02-06 13:16:02,822 INFO L231 Difference]: Finished difference. Result has 248 places, 110 transitions, 960 flow [2025-02-06 13:16:02,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=960, PETRI_PLACES=248, PETRI_TRANSITIONS=110} [2025-02-06 13:16:02,823 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2025-02-06 13:16:02,823 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 110 transitions, 960 flow [2025-02-06 13:16:02,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:02,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:02,824 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:02,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:16:03,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 13:16:03,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:03,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1675032506, now seen corresponding path program 4 times [2025-02-06 13:16:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:16:03,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592033317] [2025-02-06 13:16:03,026 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:16:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:16:03,035 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-02-06 13:16:03,100 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 13:16:03,100 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:16:03,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:16:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592033317] [2025-02-06 13:16:07,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592033317] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:16:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431257823] [2025-02-06 13:16:07,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:16:07,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:07,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:07,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:07,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:16:07,926 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-02-06 13:16:07,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 13:16:07,980 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:16:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:07,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-06 13:16:07,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:11,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:16:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431257823] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:16:15,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:16:15,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2025-02-06 13:16:15,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708666745] [2025-02-06 13:16:15,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:16:15,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2025-02-06 13:16:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:16:15,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2025-02-06 13:16:15,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15048, Invalid=25554, Unknown=0, NotChecked=0, Total=40602 [2025-02-06 13:16:15,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-06 13:16:15,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 110 transitions, 960 flow. Second operand has 202 states, 202 states have (on average 8.064356435643564) internal successors, (1629), 202 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:15,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:15,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-06 13:16:15,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:23,169 INFO L124 PetriNetUnfolderBase]: 537/1089 cut-off events. [2025-02-06 13:16:23,169 INFO L125 PetriNetUnfolderBase]: For 139341/139341 co-relation queries the response was YES. [2025-02-06 13:16:23,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4202 conditions, 1089 events. 537/1089 cut-off events. For 139341/139341 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2534 event pairs, 15 based on Foata normal form. 35/1124 useless extension candidates. Maximal degree in co-relation 4110. Up to 291 conditions per place. [2025-02-06 13:16:23,180 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 317 selfloop transitions, 104 changer transitions 0/423 dead transitions. [2025-02-06 13:16:23,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 423 transitions, 2572 flow [2025-02-06 13:16:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-02-06 13:16:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-02-06 13:16:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1163 transitions. [2025-02-06 13:16:23,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819376026272578 [2025-02-06 13:16:23,188 INFO L175 Difference]: Start difference. First operand has 248 places, 110 transitions, 960 flow. Second operand 105 states and 1163 transitions. [2025-02-06 13:16:23,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 423 transitions, 2572 flow [2025-02-06 13:16:23,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 423 transitions, 2170 flow, removed 152 selfloop flow, removed 49 redundant places. [2025-02-06 13:16:23,330 INFO L231 Difference]: Finished difference. Result has 310 places, 117 transitions, 852 flow [2025-02-06 13:16:23,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=852, PETRI_PLACES=310, PETRI_TRANSITIONS=117} [2025-02-06 13:16:23,331 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 281 predicate places. [2025-02-06 13:16:23,331 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 117 transitions, 852 flow [2025-02-06 13:16:23,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 202 states, 202 states have (on average 8.064356435643564) internal successors, (1629), 202 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:23,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:23,331 INFO L206 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:23,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:16:23,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:23,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:23,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash -485614287, now seen corresponding path program 5 times [2025-02-06 13:16:23,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:16:23,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973184659] [2025-02-06 13:16:23,533 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 13:16:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:16:23,540 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 113 statements into 52 equivalence classes. [2025-02-06 13:16:23,610 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 13:16:23,610 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-02-06 13:16:23,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:16:23,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:16:23,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 13:16:23,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 13:16:23,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:23,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:16:23,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:16:23,741 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:16:23,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-02-06 13:16:23,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-06 13:16:23,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-06 13:16:23,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-06 13:16:23,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-02-06 13:16:23,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:16:23,745 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1] [2025-02-06 13:16:23,883 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:16:23,885 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:16:23,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:16:23 BasicIcfg [2025-02-06 13:16:23,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:16:23,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:16:23,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:16:23,893 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:16:23,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:38" (3/4) ... [2025-02-06 13:16:23,895 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 13:16:23,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:16:23,896 INFO L158 Benchmark]: Toolchain (without parser) took 46478.71ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 105.6MB in the beginning and 152.5MB in the end (delta: -46.9MB). Peak memory consumption was 227.3MB. Max. memory is 16.1GB. [2025-02-06 13:16:23,896 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:16:23,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.32ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 85.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:16:23,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.23ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:16:23,897 INFO L158 Benchmark]: Boogie Preprocessor took 38.38ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.9MB in the end (delta: 922.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:16:23,897 INFO L158 Benchmark]: IcfgBuilder took 418.80ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 62.6MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:16:23,899 INFO L158 Benchmark]: TraceAbstraction took 45609.90ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 62.6MB in the beginning and 152.6MB in the end (delta: -90.1MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. [2025-02-06 13:16:23,899 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 419.4MB. Free memory was 152.6MB in the beginning and 152.5MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:16:23,900 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.32ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 85.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.23ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 83.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.38ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.9MB in the end (delta: 922.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 418.80ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 62.6MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45609.90ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 62.6MB in the beginning and 152.6MB in the end (delta: -90.1MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 419.4MB. Free memory was 152.6MB in the beginning and 152.5MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-1, t2=0] [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L752] 2 __assert_fail ("0", "generated/unwind1.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] - UnprovableResult [Line: 771]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 43 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 45.3s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5569 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5569 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2872 IncrementalHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1 mSDtfsCounter, 2872 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1040 GetRequests, 152 SyntacticMatches, 94 SemanticMatches, 794 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57615 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=9, InterpolantAutomatonStates: 334, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 691 NumberOfCodeBlocks, 675 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 825 ConstructedInterpolants, 0 QuantifiedInterpolants, 3793 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1094 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 136/17761 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 13:16:23,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:16:26,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:16:26,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 13:16:26,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:16:26,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:16:26,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:16:26,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:16:26,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:16:26,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:16:26,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:16:26,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:16:26,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:16:26,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:16:26,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:16:26,159 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:16:26,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:16:26,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:16:26,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:16:26,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:16:26,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:16:26,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:16:26,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:16:26,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:16:26,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:16:26,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:16:26,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:16:26,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-02-06 13:16:26,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:16:26,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:16:26,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:16:26,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:16:26,471 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:16:26,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-02-06 13:16:27,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c7fcc9fb/211e87304c354b60bca6a4ce80b9325d/FLAGbc8b9051c [2025-02-06 13:16:28,123 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:16:28,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-02-06 13:16:28,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c7fcc9fb/211e87304c354b60bca6a4ce80b9325d/FLAGbc8b9051c [2025-02-06 13:16:28,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c7fcc9fb/211e87304c354b60bca6a4ce80b9325d [2025-02-06 13:16:28,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:16:28,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:16:28,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:16:28,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:16:28,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:16:28,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9503d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28, skipping insertion in model container [2025-02-06 13:16:28,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:16:28,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:16:28,538 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:16:28,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:16:28,641 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:16:28,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28 WrapperNode [2025-02-06 13:16:28,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:16:28,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:16:28,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:16:28,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:16:28,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,687 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 54 [2025-02-06 13:16:28,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:16:28,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:16:28,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:16:28,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:16:28,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,718 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:16:28,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:16:28,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:16:28,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:16:28,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:16:28,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (1/1) ... [2025-02-06 13:16:28,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:16:28,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:28,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:16:28,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:16:28,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:16:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-06 13:16:28,786 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-06 13:16:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-06 13:16:28,786 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-06 13:16:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 13:16:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:16:28,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:16:28,788 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:16:28,895 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:16:28,897 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:16:29,065 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:16:29,065 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:16:29,207 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:16:29,207 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:16:29,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:16:29 BoogieIcfgContainer [2025-02-06 13:16:29,207 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:16:29,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:16:29,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:16:29,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:16:29,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:16:28" (1/3) ... [2025-02-06 13:16:29,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310906fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:16:29, skipping insertion in model container [2025-02-06 13:16:29,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:16:28" (2/3) ... [2025-02-06 13:16:29,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310906fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:16:29, skipping insertion in model container [2025-02-06 13:16:29,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:16:29" (3/3) ... [2025-02-06 13:16:29,218 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-02-06 13:16:29,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:16:29,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-06 13:16:29,232 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:16:29,293 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 13:16:29,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2025-02-06 13:16:29,351 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-02-06 13:16:29,357 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 13:16:29,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-02-06 13:16:29,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2025-02-06 13:16:29,364 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-02-06 13:16:29,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:16:29,378 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;@2352e780, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:16:29,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 13:16:29,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:16:29,388 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-02-06 13:16:29,388 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 13:16:29,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:29,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:29,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:29,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash 118860338, now seen corresponding path program 1 times [2025-02-06 13:16:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869808710] [2025-02-06 13:16:29,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:29,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:29,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:16:29,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:16:29,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:16:29,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:29,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:29,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:16:29,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:29,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:16:29,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869808710] [2025-02-06 13:16:29,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869808710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:16:29,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:16:29,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:16:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512106974] [2025-02-06 13:16:29,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:16:29,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:16:29,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:29,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:16:29,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:16:29,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-06 13:16:29,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:29,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:29,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-06 13:16:29,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:29,817 INFO L124 PetriNetUnfolderBase]: 165/337 cut-off events. [2025-02-06 13:16:29,817 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 13:16:29,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 337 events. 165/337 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1405 event pairs, 83 based on Foata normal form. 39/332 useless extension candidates. Maximal degree in co-relation 588. Up to 187 conditions per place. [2025-02-06 13:16:29,821 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2025-02-06 13:16:29,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 183 flow [2025-02-06 13:16:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:16:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:16:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-02-06 13:16:29,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5241379310344828 [2025-02-06 13:16:29,837 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 5 states and 76 transitions. [2025-02-06 13:16:29,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 183 flow [2025-02-06 13:16:29,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 43 transitions, 169 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 13:16:29,845 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 80 flow [2025-02-06 13:16:29,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2025-02-06 13:16:29,850 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2025-02-06 13:16:29,850 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 80 flow [2025-02-06 13:16:29,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:29,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:29,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:29,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:16:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:30,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:30,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash -611282715, now seen corresponding path program 1 times [2025-02-06 13:16:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407680901] [2025-02-06 13:16:30,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:30,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:30,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:30,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:30,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:16:30,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:16:30,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:16:30,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:30,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:30,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:16:30,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:30,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:16:30,162 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407680901] [2025-02-06 13:16:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407680901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:16:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:16:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:16:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017033213] [2025-02-06 13:16:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:16:30,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:16:30,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:30,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:16:30,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:16:30,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-06 13:16:30,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:30,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:30,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-06 13:16:30,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:30,336 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2025-02-06 13:16:30,337 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-02-06 13:16:30,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 247 events. 111/247 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 949 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 260. Up to 97 conditions per place. [2025-02-06 13:16:30,339 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2025-02-06 13:16:30,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 216 flow [2025-02-06 13:16:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:16:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:16:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-02-06 13:16:30,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-02-06 13:16:30,341 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 80 flow. Second operand 5 states and 73 transitions. [2025-02-06 13:16:30,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 216 flow [2025-02-06 13:16:30,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:16:30,343 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 111 flow [2025-02-06 13:16:30,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-02-06 13:16:30,344 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2025-02-06 13:16:30,344 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 111 flow [2025-02-06 13:16:30,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:30,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:30,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:30,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:16:30,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:30,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:30,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:30,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1592092753, now seen corresponding path program 1 times [2025-02-06 13:16:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:30,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914115134] [2025-02-06 13:16:30,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:30,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:30,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:30,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:16:30,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:16:30,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:16:30,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:30,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:30,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:16:30,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:30,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:16:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:30,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:30,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914115134] [2025-02-06 13:16:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914115134] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:16:30,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:16:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-06 13:16:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9151269] [2025-02-06 13:16:30,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:16:30,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:16:30,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:30,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:16:30,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:16:30,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-02-06 13:16:30,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:30,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:30,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-02-06 13:16:30,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:31,147 INFO L124 PetriNetUnfolderBase]: 163/372 cut-off events. [2025-02-06 13:16:31,148 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2025-02-06 13:16:31,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 372 events. 163/372 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1638 event pairs, 63 based on Foata normal form. 10/362 useless extension candidates. Maximal degree in co-relation 554. Up to 93 conditions per place. [2025-02-06 13:16:31,154 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2025-02-06 13:16:31,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 375 flow [2025-02-06 13:16:31,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:16:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 13:16:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2025-02-06 13:16:31,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445141065830721 [2025-02-06 13:16:31,157 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 111 flow. Second operand 11 states and 142 transitions. [2025-02-06 13:16:31,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 375 flow [2025-02-06 13:16:31,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:16:31,163 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 196 flow [2025-02-06 13:16:31,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2025-02-06 13:16:31,165 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2025-02-06 13:16:31,165 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 196 flow [2025-02-06 13:16:31,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:31,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:31,166 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:31,176 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-06 13:16:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:31,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash -564924154, now seen corresponding path program 1 times [2025-02-06 13:16:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:31,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128910602] [2025-02-06 13:16:31,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:31,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:31,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:31,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:31,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:16:31,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:16:31,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:16:31,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:31,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:31,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:16:31,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:31,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:16:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:31,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:31,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128910602] [2025-02-06 13:16:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128910602] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:16:31,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:16:31,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-06 13:16:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322740897] [2025-02-06 13:16:31,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:16:31,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:16:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:31,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:16:31,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:16:31,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:16:31,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 196 flow. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:31,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:31,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:16:31,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:32,023 INFO L124 PetriNetUnfolderBase]: 317/674 cut-off events. [2025-02-06 13:16:32,023 INFO L125 PetriNetUnfolderBase]: For 672/672 co-relation queries the response was YES. [2025-02-06 13:16:32,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 674 events. 317/674 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3187 event pairs, 71 based on Foata normal form. 30/692 useless extension candidates. Maximal degree in co-relation 1279. Up to 148 conditions per place. [2025-02-06 13:16:32,027 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 72 selfloop transitions, 28 changer transitions 0/104 dead transitions. [2025-02-06 13:16:32,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 633 flow [2025-02-06 13:16:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 13:16:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 13:16:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 185 transitions. [2025-02-06 13:16:32,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2025-02-06 13:16:32,030 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 196 flow. Second operand 15 states and 185 transitions. [2025-02-06 13:16:32,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 633 flow [2025-02-06 13:16:32,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 580 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-02-06 13:16:32,043 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 339 flow [2025-02-06 13:16:32,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=339, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-02-06 13:16:32,044 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2025-02-06 13:16:32,044 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 339 flow [2025-02-06 13:16:32,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:32,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:32,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:32,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 13:16:32,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:32,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:32,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1228075413, now seen corresponding path program 1 times [2025-02-06 13:16:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:32,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324595560] [2025-02-06 13:16:32,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:16:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:32,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:32,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:16:32,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:16:32,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:16:32,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:16:32,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:32,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:16:32,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:32,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:16:32,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324595560] [2025-02-06 13:16:32,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324595560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:16:32,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:16:32,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:16:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365624290] [2025-02-06 13:16:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:16:32,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:16:32,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:32,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:16:32,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:16:32,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:16:32,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:32,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:32,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:16:32,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:32,408 INFO L124 PetriNetUnfolderBase]: 253/590 cut-off events. [2025-02-06 13:16:32,408 INFO L125 PetriNetUnfolderBase]: For 1140/1140 co-relation queries the response was YES. [2025-02-06 13:16:32,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 590 events. 253/590 cut-off events. For 1140/1140 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2937 event pairs, 243 based on Foata normal form. 10/590 useless extension candidates. Maximal degree in co-relation 1801. Up to 512 conditions per place. [2025-02-06 13:16:32,411 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 29 selfloop transitions, 1 changer transitions 17/50 dead transitions. [2025-02-06 13:16:32,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 50 transitions, 427 flow [2025-02-06 13:16:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:16:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:16:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-02-06 13:16:32,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2025-02-06 13:16:32,412 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 339 flow. Second operand 3 states and 37 transitions. [2025-02-06 13:16:32,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 50 transitions, 427 flow [2025-02-06 13:16:32,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 330 flow, removed 36 selfloop flow, removed 7 redundant places. [2025-02-06 13:16:32,421 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 153 flow [2025-02-06 13:16:32,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2025-02-06 13:16:32,421 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2025-02-06 13:16:32,421 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 153 flow [2025-02-06 13:16:32,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:32,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:32,422 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:32,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:16:32,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:32,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:32,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash -960852792, now seen corresponding path program 2 times [2025-02-06 13:16:32,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:32,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662347856] [2025-02-06 13:16:32,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:16:32,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:32,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:32,626 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:32,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:16:32,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 13:16:32,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:16:32,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:16:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:32,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:16:32,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:32,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:16:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:33,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662347856] [2025-02-06 13:16:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662347856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:16:33,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:16:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-02-06 13:16:33,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833585301] [2025-02-06 13:16:33,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:16:33,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 13:16:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:33,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 13:16:33,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-02-06 13:16:33,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:16:33,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 153 flow. Second operand has 20 states, 20 states have (on average 7.6) internal successors, (152), 20 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:33,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:33,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:16:33,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:33,979 INFO L124 PetriNetUnfolderBase]: 371/766 cut-off events. [2025-02-06 13:16:33,980 INFO L125 PetriNetUnfolderBase]: For 1034/1034 co-relation queries the response was YES. [2025-02-06 13:16:33,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 766 events. 371/766 cut-off events. For 1034/1034 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3314 event pairs, 51 based on Foata normal form. 80/842 useless extension candidates. Maximal degree in co-relation 2157. Up to 191 conditions per place. [2025-02-06 13:16:33,984 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 57 selfloop transitions, 31 changer transitions 44/134 dead transitions. [2025-02-06 13:16:33,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 746 flow [2025-02-06 13:16:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 13:16:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-06 13:16:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 280 transitions. [2025-02-06 13:16:33,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3713527851458886 [2025-02-06 13:16:33,989 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 153 flow. Second operand 26 states and 280 transitions. [2025-02-06 13:16:33,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 746 flow [2025-02-06 13:16:33,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 694 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-02-06 13:16:33,997 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 331 flow [2025-02-06 13:16:33,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=331, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2025-02-06 13:16:33,997 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2025-02-06 13:16:33,998 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 331 flow [2025-02-06 13:16:33,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.6) internal successors, (152), 20 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:33,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:33,998 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:34,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:16:34,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:34,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:34,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash 473194568, now seen corresponding path program 3 times [2025-02-06 13:16:34,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:34,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385790471] [2025-02-06 13:16:34,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:16:34,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:34,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:34,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:34,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:16:34,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 8 equivalence classes. [2025-02-06 13:16:34,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-02-06 13:16:34,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:16:34,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:34,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:16:34,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-06 13:16:34,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:16:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 13:16:34,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385790471] [2025-02-06 13:16:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385790471] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:16:34,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:16:34,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2025-02-06 13:16:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930190842] [2025-02-06 13:16:34,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:16:34,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:16:34,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:34,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:16:34,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:16:34,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:16:34,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 331 flow. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:34,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:34,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:16:34,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:35,288 INFO L124 PetriNetUnfolderBase]: 196/406 cut-off events. [2025-02-06 13:16:35,288 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2025-02-06 13:16:35,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 406 events. 196/406 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1328 event pairs, 57 based on Foata normal form. 5/407 useless extension candidates. Maximal degree in co-relation 1427. Up to 180 conditions per place. [2025-02-06 13:16:35,291 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 30 selfloop transitions, 4 changer transitions 33/69 dead transitions. [2025-02-06 13:16:35,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 532 flow [2025-02-06 13:16:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:16:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 13:16:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-02-06 13:16:35,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.367816091954023 [2025-02-06 13:16:35,294 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 331 flow. Second operand 9 states and 96 transitions. [2025-02-06 13:16:35,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 532 flow [2025-02-06 13:16:35,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 427 flow, removed 40 selfloop flow, removed 15 redundant places. [2025-02-06 13:16:35,298 INFO L231 Difference]: Finished difference. Result has 60 places, 30 transitions, 149 flow [2025-02-06 13:16:35,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=30} [2025-02-06 13:16:35,299 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2025-02-06 13:16:35,299 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 30 transitions, 149 flow [2025-02-06 13:16:35,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:35,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:35,299 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:35,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 13:16:35,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:35,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:35,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1973685946, now seen corresponding path program 2 times [2025-02-06 13:16:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918801174] [2025-02-06 13:16:35,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:16:35,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:35,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:35,503 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:35,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:16:35,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 13:16:35,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:16:35,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:16:35,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:35,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 13:16:35,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:35,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:16:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:36,542 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:36,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918801174] [2025-02-06 13:16:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918801174] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:16:36,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:16:36,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2025-02-06 13:16:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366956530] [2025-02-06 13:16:36,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:16:36,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 13:16:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:36,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 13:16:36,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=934, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 13:16:36,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:16:36,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 30 transitions, 149 flow. Second operand has 36 states, 36 states have (on average 7.333333333333333) internal successors, (264), 36 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:36,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:36,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:16:36,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:16:39,941 INFO L124 PetriNetUnfolderBase]: 262/539 cut-off events. [2025-02-06 13:16:39,942 INFO L125 PetriNetUnfolderBase]: For 3229/3229 co-relation queries the response was YES. [2025-02-06 13:16:39,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 539 events. 262/539 cut-off events. For 3229/3229 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1546 event pairs, 27 based on Foata normal form. 80/619 useless extension candidates. Maximal degree in co-relation 2315. Up to 176 conditions per place. [2025-02-06 13:16:39,945 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 102 selfloop transitions, 32 changer transitions 64/200 dead transitions. [2025-02-06 13:16:39,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 200 transitions, 1347 flow [2025-02-06 13:16:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-06 13:16:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-02-06 13:16:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 508 transitions. [2025-02-06 13:16:39,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3574947220267417 [2025-02-06 13:16:39,949 INFO L175 Difference]: Start difference. First operand has 60 places, 30 transitions, 149 flow. Second operand 49 states and 508 transitions. [2025-02-06 13:16:39,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 200 transitions, 1347 flow [2025-02-06 13:16:39,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 200 transitions, 1279 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-02-06 13:16:39,957 INFO L231 Difference]: Finished difference. Result has 124 places, 46 transitions, 403 flow [2025-02-06 13:16:39,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=403, PETRI_PLACES=124, PETRI_TRANSITIONS=46} [2025-02-06 13:16:39,958 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2025-02-06 13:16:39,960 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 46 transitions, 403 flow [2025-02-06 13:16:39,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.333333333333333) internal successors, (264), 36 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:39,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:16:39,961 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:16:39,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 13:16:40,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:40,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 13:16:40,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:16:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash -497591226, now seen corresponding path program 3 times [2025-02-06 13:16:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:16:40,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775603958] [2025-02-06 13:16:40,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:16:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:16:40,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:16:40,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:16:40,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:16:40,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 16 equivalence classes. [2025-02-06 13:16:40,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:16:40,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-02-06 13:16:40,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:16:40,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 13:16:40,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:16:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:40,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:16:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:16:43,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:16:43,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775603958] [2025-02-06 13:16:43,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775603958] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:16:43,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:16:43,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2025-02-06 13:16:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055174352] [2025-02-06 13:16:43,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 13:16:43,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-02-06 13:16:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:16:43,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-02-06 13:16:43,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1158, Invalid=3398, Unknown=0, NotChecked=0, Total=4556 [2025-02-06 13:16:43,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-02-06 13:16:43,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 46 transitions, 403 flow. Second operand has 68 states, 68 states have (on average 7.176470588235294) internal successors, (488), 68 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:16:43,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:16:43,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-02-06 13:16:43,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand