./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 551b0097 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-?-551b009-m [2025-01-10 01:16:23,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:16:23,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:16:23,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:16:23,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:16:23,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:16:23,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:16:23,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:16:23,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:16:23,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:16:23,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:16:23,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:16:23,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:16:23,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:16:23,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:16:23,266 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:23,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:23,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:16:23,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:16:23,267 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-01-10 01:16:23,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:16:23,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:16:23,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:16:23,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:16:23,488 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:16:23,489 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-01-10 01:16:24,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3abcd2f39/ca08944bc5124069967032be1ceb0974/FLAG357a056e3 [2025-01-10 01:16:25,086 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:16:25,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-01-10 01:16:25,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3abcd2f39/ca08944bc5124069967032be1ceb0974/FLAG357a056e3 [2025-01-10 01:16:25,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3abcd2f39/ca08944bc5124069967032be1ceb0974 [2025-01-10 01:16:25,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:16:25,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:16:25,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:25,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:16:25,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:16:25,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a45436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25, skipping insertion in model container [2025-01-10 01:16:25,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:16:25,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:25,633 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:16:25,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:25,686 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:16:25,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25 WrapperNode [2025-01-10 01:16:25,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:25,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:25,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:16:25,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:16:25,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,712 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 53 [2025-01-10 01:16:25,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:25,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:16:25,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:16:25,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:16:25,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,747 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-01-10 01:16:25,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:16:25,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:16:25,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:16:25,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:16:25,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (1/1) ... [2025-01-10 01:16:25,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:25,794 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-01-10 01:16:25,799 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-01-10 01:16:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:16:25,817 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 01:16:25,818 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 01:16:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 01:16:25,818 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 01:16:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:16:25,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:16:25,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:16:25,819 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:16:25,896 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:16:25,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:16:25,991 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:16:25,992 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:16:26,071 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:16:26,071 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:16:26,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:26 BoogieIcfgContainer [2025-01-10 01:16:26,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:16:26,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:16:26,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:16:26,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:16:26,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:16:25" (1/3) ... [2025-01-10 01:16:26,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f06fd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:26, skipping insertion in model container [2025-01-10 01:16:26,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:25" (2/3) ... [2025-01-10 01:16:26,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f06fd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:26, skipping insertion in model container [2025-01-10 01:16:26,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:26" (3/3) ... [2025-01-10 01:16:26,085 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-01-10 01:16:26,097 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:16:26,098 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-01-10 01:16:26,098 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:16:26,139 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:16:26,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2025-01-10 01:16:26,197 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-01-10 01:16:26,201 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:16:26,204 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 36 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-01-10 01:16:26,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2025-01-10 01:16:26,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-01-10 01:16:26,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:26,226 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;@6901c662, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:26,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 01:16:26,237 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:26,240 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-01-10 01:16:26,240 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:16:26,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:26,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:26,241 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-01-10 01:16:26,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1549092178, now seen corresponding path program 1 times [2025-01-10 01:16:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636808236] [2025-01-10 01:16:26,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:26,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:16:26,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:16:26,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:26,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:26,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636808236] [2025-01-10 01:16:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636808236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:26,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:26,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214684054] [2025-01-10 01:16:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:26,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:26,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:26,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:26,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:16:26,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-01-10 01:16:26,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:26,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:16:26,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:26,666 INFO L124 PetriNetUnfolderBase]: 151/300 cut-off events. [2025-01-10 01:16:26,666 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-10 01:16:26,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 300 events. 151/300 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1199 event pairs, 68 based on Foata normal form. 22/266 useless extension candidates. Maximal degree in co-relation 530. Up to 146 conditions per place. [2025-01-10 01:16:26,670 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 33 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2025-01-10 01:16:26,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 196 flow [2025-01-10 01:16:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:16:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:16:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-01-10 01:16:26,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2025-01-10 01:16:26,680 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 6 states and 91 transitions. [2025-01-10 01:16:26,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 196 flow [2025-01-10 01:16:26,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:16:26,685 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 91 flow [2025-01-10 01:16:26,687 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-01-10 01:16:26,689 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2025-01-10 01:16:26,690 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 91 flow [2025-01-10 01:16:26,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-01-10 01:16:26,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:26,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:26,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:16:26,690 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-01-10 01:16:26,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash 776231413, now seen corresponding path program 1 times [2025-01-10 01:16:26,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:26,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758578329] [2025-01-10 01:16:26,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:26,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:26,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:16:26,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:16:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:26,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:26,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758578329] [2025-01-10 01:16:26,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758578329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:26,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:26,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:26,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729936440] [2025-01-10 01:16:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:26,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:26,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:26,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:26,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-01-10 01:16:26,775 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-01-10 01:16:26,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:26,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-01-10 01:16:26,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:26,894 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2025-01-10 01:16:26,894 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-01-10 01:16:26,895 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 946 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-01-10 01:16:26,896 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-01-10 01:16:26,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 228 flow [2025-01-10 01:16:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:16:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:16:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-01-10 01:16:26,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-01-10 01:16:26,901 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 91 flow. Second operand 5 states and 73 transitions. [2025-01-10 01:16:26,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 228 flow [2025-01-10 01:16:26,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:26,905 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 127 flow [2025-01-10 01:16:26,907 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-01-10 01:16:26,907 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2025-01-10 01:16:26,907 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 127 flow [2025-01-10 01:16:26,908 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-01-10 01:16:26,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:26,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:26,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:16:26,908 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-01-10 01:16:26,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1683085573, now seen corresponding path program 1 times [2025-01-10 01:16:26,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:26,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553298734] [2025-01-10 01:16:26,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:26,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:16:26,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:16:26,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:26,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:27,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553298734] [2025-01-10 01:16:27,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553298734] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121116093] [2025-01-10 01:16:27,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:27,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:27,047 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-01-10 01:16:27,055 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-01-10 01:16:27,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:16:27,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:16:27,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:27,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:27,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:16:27,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:27,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121116093] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:27,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:27,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:16:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662584644] [2025-01-10 01:16:27,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:27,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:16:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:27,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:16:27,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:16:27,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-01-10 01:16:27,274 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-01-10 01:16:27,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:27,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-01-10 01:16:27,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:27,505 INFO L124 PetriNetUnfolderBase]: 140/279 cut-off events. [2025-01-10 01:16:27,505 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-01-10 01:16:27,506 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 903 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-01-10 01:16:27,508 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 48 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2025-01-10 01:16:27,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 376 flow [2025-01-10 01:16:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:16:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:16:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2025-01-10 01:16:27,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3952254641909814 [2025-01-10 01:16:27,510 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 127 flow. Second operand 13 states and 149 transitions. [2025-01-10 01:16:27,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 376 flow [2025-01-10 01:16:27,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:27,513 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 212 flow [2025-01-10 01:16:27,513 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-01-10 01:16:27,513 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2025-01-10 01:16:27,513 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 212 flow [2025-01-10 01:16:27,514 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-01-10 01:16:27,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:27,514 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:27,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:16:27,715 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-01-10 01:16:27,716 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-01-10 01:16:27,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1961927500, now seen corresponding path program 2 times [2025-01-10 01:16:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519582823] [2025-01-10 01:16:27,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:16:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:27,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:16:27,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:16:27,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:16:27,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:27,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519582823] [2025-01-10 01:16:27,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519582823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059257495] [2025-01-10 01:16:27,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:16:27,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:27,883 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-01-10 01:16:27,886 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-01-10 01:16:27,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:16:27,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:16:27,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:16:27,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:27,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:16:27,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:28,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059257495] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:28,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-01-10 01:16:28,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707170506] [2025-01-10 01:16:28,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:28,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:16:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:28,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:16:28,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:16:28,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:16:28,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 212 flow. Second operand has 21 states, 21 states have (on average 9.523809523809524) internal successors, (200), 21 states have internal predecessors, (200), 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-01-10 01:16:28,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:28,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:16:28,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:28,526 INFO L124 PetriNetUnfolderBase]: 247/520 cut-off events. [2025-01-10 01:16:28,526 INFO L125 PetriNetUnfolderBase]: For 453/456 co-relation queries the response was YES. [2025-01-10 01:16:28,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 520 events. 247/520 cut-off events. For 453/456 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2091 event pairs, 35 based on Foata normal form. 30/535 useless extension candidates. Maximal degree in co-relation 1342. Up to 104 conditions per place. [2025-01-10 01:16:28,530 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 87 selfloop transitions, 31 changer transitions 0/128 dead transitions. [2025-01-10 01:16:28,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 787 flow [2025-01-10 01:16:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:16:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:16:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 289 transitions. [2025-01-10 01:16:28,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4745484400656814 [2025-01-10 01:16:28,532 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 212 flow. Second operand 21 states and 289 transitions. [2025-01-10 01:16:28,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 787 flow [2025-01-10 01:16:28,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 128 transitions, 701 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-01-10 01:16:28,538 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 379 flow [2025-01-10 01:16:28,539 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-01-10 01:16:28,539 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2025-01-10 01:16:28,539 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 379 flow [2025-01-10 01:16:28,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.523809523809524) internal successors, (200), 21 states have internal predecessors, (200), 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-01-10 01:16:28,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:28,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:28,547 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-01-10 01:16:28,740 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-01-10 01:16:28,741 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-01-10 01:16:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1515448469, now seen corresponding path program 1 times [2025-01-10 01:16:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:28,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840320771] [2025-01-10 01:16:28,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:28,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:16:28,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:16:28,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:28,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:28,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:28,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840320771] [2025-01-10 01:16:28,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840320771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:28,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:28,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:28,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659922004] [2025-01-10 01:16:28,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:28,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:28,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:28,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:28,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:28,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:16:28,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-10 01:16:28,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:28,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:16:28,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:28,857 INFO L124 PetriNetUnfolderBase]: 198/460 cut-off events. [2025-01-10 01:16:28,858 INFO L125 PetriNetUnfolderBase]: For 594/595 co-relation queries the response was YES. [2025-01-10 01:16:28,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 460 events. 198/460 cut-off events. For 594/595 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1935 event pairs, 175 based on Foata normal form. 8/457 useless extension candidates. Maximal degree in co-relation 1414. Up to 383 conditions per place. [2025-01-10 01:16:28,862 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 23 selfloop transitions, 1 changer transitions 26/55 dead transitions. [2025-01-10 01:16:28,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 463 flow [2025-01-10 01:16:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-01-10 01:16:28,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2025-01-10 01:16:28,865 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 379 flow. Second operand 3 states and 41 transitions. [2025-01-10 01:16:28,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 463 flow [2025-01-10 01:16:28,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 350 flow, removed 41 selfloop flow, removed 10 redundant places. [2025-01-10 01:16:28,872 INFO L231 Difference]: Finished difference. Result has 60 places, 29 transitions, 117 flow [2025-01-10 01:16:28,872 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-01-10 01:16:28,873 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2025-01-10 01:16:28,874 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 29 transitions, 117 flow [2025-01-10 01:16:28,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-10 01:16:28,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:28,874 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:28,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:16:28,874 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-01-10 01:16:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash -700467988, now seen corresponding path program 3 times [2025-01-10 01:16:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818825630] [2025-01-10 01:16:28,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:16:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:28,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-01-10 01:16:28,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 22 statements. [2025-01-10 01:16:28,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:16:28,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 01:16:28,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818825630] [2025-01-10 01:16:28,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818825630] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515583575] [2025-01-10 01:16:28,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:16:28,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:28,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:28,980 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-01-10 01:16:28,984 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-01-10 01:16:29,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 6 equivalence classes. [2025-01-10 01:16:29,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 22 statements. [2025-01-10 01:16:29,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:16:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:29,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:16:29,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 01:16:29,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 01:16:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515583575] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:29,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:29,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-01-10 01:16:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791937116] [2025-01-10 01:16:29,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:29,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:16:29,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:29,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:16:29,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:16:29,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-01-10 01:16:29,103 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-01-10 01:16:29,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:29,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-01-10 01:16:29,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:29,224 INFO L124 PetriNetUnfolderBase]: 166/346 cut-off events. [2025-01-10 01:16:29,225 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2025-01-10 01:16:29,226 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 1132 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-01-10 01:16:29,228 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 25 selfloop transitions, 2 changer transitions 31/60 dead transitions. [2025-01-10 01:16:29,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 333 flow [2025-01-10 01:16:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:16:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:16:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-01-10 01:16:29,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4039408866995074 [2025-01-10 01:16:29,229 INFO L175 Difference]: Start difference. First operand has 60 places, 29 transitions, 117 flow. Second operand 7 states and 82 transitions. [2025-01-10 01:16:29,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 333 flow [2025-01-10 01:16:29,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 277 flow, removed 19 selfloop flow, removed 11 redundant places. [2025-01-10 01:16:29,232 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 82 flow [2025-01-10 01:16:29,232 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-01-10 01:16:29,233 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2025-01-10 01:16:29,233 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 82 flow [2025-01-10 01:16:29,233 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-01-10 01:16:29,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:29,234 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:29,240 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-01-10 01:16:29,438 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-01-10 01:16:29,438 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-01-10 01:16:29,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:29,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2086892778, now seen corresponding path program 1 times [2025-01-10 01:16:29,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:29,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622881087] [2025-01-10 01:16:29,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:29,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:29,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:16:29,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:16:29,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:29,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622881087] [2025-01-10 01:16:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622881087] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951861562] [2025-01-10 01:16:29,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:29,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:29,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:29,664 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-01-10 01:16:29,666 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-01-10 01:16:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:16:29,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:16:29,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:29,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:29,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:16:29,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:29,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951861562] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:30,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2025-01-10 01:16:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189729228] [2025-01-10 01:16:30,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:30,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-10 01:16:30,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:30,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-10 01:16:30,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 01:16:30,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-01-10 01:16:30,221 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-01-10 01:16:30,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:30,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-01-10 01:16:30,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:30,844 INFO L124 PetriNetUnfolderBase]: 142/299 cut-off events. [2025-01-10 01:16:30,845 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-10 01:16:30,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 299 events. 142/299 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 690 event pairs, 15 based on Foata normal form. 60/359 useless extension candidates. Maximal degree in co-relation 769. Up to 76 conditions per place. [2025-01-10 01:16:30,846 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 80 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2025-01-10 01:16:30,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 525 flow [2025-01-10 01:16:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 01:16:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 01:16:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 299 transitions. [2025-01-10 01:16:30,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39655172413793105 [2025-01-10 01:16:30,848 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 82 flow. Second operand 26 states and 299 transitions. [2025-01-10 01:16:30,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 525 flow [2025-01-10 01:16:30,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 107 transitions, 511 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-10 01:16:30,850 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 240 flow [2025-01-10 01:16:30,850 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-01-10 01:16:30,850 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2025-01-10 01:16:30,850 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 240 flow [2025-01-10 01:16:30,851 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-01-10 01:16:30,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:30,851 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:30,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:16:31,055 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-01-10 01:16:31,055 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-01-10 01:16:31,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:31,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1279106262, now seen corresponding path program 2 times [2025-01-10 01:16:31,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:31,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416280122] [2025-01-10 01:16:31,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:16:31,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:31,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:16:31,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:16:31,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:16:31,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:31,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:31,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416280122] [2025-01-10 01:16:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416280122] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:31,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351730172] [2025-01-10 01:16:31,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:16:31,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:31,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:31,599 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-01-10 01:16:31,601 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-01-10 01:16:31,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 01:16:31,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:16:31,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:16:31,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:31,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:16:31,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:32,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:33,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351730172] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:33,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-01-10 01:16:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583505910] [2025-01-10 01:16:33,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:33,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-01-10 01:16:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:33,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-01-10 01:16:33,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2025-01-10 01:16:33,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-01-10 01:16:33,185 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-01-10 01:16:33,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:33,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-01-10 01:16:33,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:34,960 INFO L124 PetriNetUnfolderBase]: 262/539 cut-off events. [2025-01-10 01:16:34,960 INFO L125 PetriNetUnfolderBase]: For 8312/8312 co-relation queries the response was YES. [2025-01-10 01:16:34,961 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-01-10 01:16:34,963 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 152 selfloop transitions, 49 changer transitions 0/203 dead transitions. [2025-01-10 01:16:34,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 1163 flow [2025-01-10 01:16:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-10 01:16:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-01-10 01:16:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 525 transitions. [2025-01-10 01:16:34,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2025-01-10 01:16:34,965 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 240 flow. Second operand 50 states and 525 transitions. [2025-01-10 01:16:34,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 1163 flow [2025-01-10 01:16:34,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 203 transitions, 1015 flow, removed 61 selfloop flow, removed 13 redundant places. [2025-01-10 01:16:34,971 INFO L231 Difference]: Finished difference. Result has 128 places, 62 transitions, 480 flow [2025-01-10 01:16:34,971 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-01-10 01:16:34,971 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2025-01-10 01:16:34,971 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 62 transitions, 480 flow [2025-01-10 01:16:34,972 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-01-10 01:16:34,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:34,972 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:34,978 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-01-10 01:16:35,172 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-01-10 01:16:35,173 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-01-10 01:16:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1342824534, now seen corresponding path program 3 times [2025-01-10 01:16:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:35,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779866673] [2025-01-10 01:16:35,174 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:16:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:35,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 24 equivalence classes. [2025-01-10 01:16:35,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:16:35,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-01-10 01:16:35,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:36,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:36,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779866673] [2025-01-10 01:16:36,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779866673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:36,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876610498] [2025-01-10 01:16:36,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:16:36,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:36,379 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-01-10 01:16:36,381 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-01-10 01:16:36,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 24 equivalence classes. [2025-01-10 01:16:36,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:16:36,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-01-10 01:16:36,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:36,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-10 01:16:36,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:38,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876610498] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:41,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-01-10 01:16:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826496253] [2025-01-10 01:16:41,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:41,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2025-01-10 01:16:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:41,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2025-01-10 01:16:41,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2025-01-10 01:16:41,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-01-10 01:16:41,368 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-01-10 01:16:41,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:41,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-01-10 01:16:41,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:47,817 INFO L124 PetriNetUnfolderBase]: 502/1019 cut-off events. [2025-01-10 01:16:47,818 INFO L125 PetriNetUnfolderBase]: For 154388/154388 co-relation queries the response was YES. [2025-01-10 01:16:47,821 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 2370 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-01-10 01:16:47,824 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 296 selfloop transitions, 97 changer transitions 0/395 dead transitions. [2025-01-10 01:16:47,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 395 transitions, 2315 flow [2025-01-10 01:16:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-01-10 01:16:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2025-01-10 01:16:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1029 transitions. [2025-01-10 01:16:47,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2025-01-10 01:16:47,828 INFO L175 Difference]: Start difference. First operand has 128 places, 62 transitions, 480 flow. Second operand 98 states and 1029 transitions. [2025-01-10 01:16:47,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 395 transitions, 2315 flow [2025-01-10 01:16:47,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 395 transitions, 2023 flow, removed 121 selfloop flow, removed 25 redundant places. [2025-01-10 01:16:47,862 INFO L231 Difference]: Finished difference. Result has 248 places, 110 transitions, 960 flow [2025-01-10 01:16:47,863 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-01-10 01:16:47,863 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2025-01-10 01:16:47,863 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 110 transitions, 960 flow [2025-01-10 01:16:47,864 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-01-10 01:16:47,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:47,864 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:47,873 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-01-10 01:16:48,068 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-01-10 01:16:48,068 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-01-10 01:16:48,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash 267720874, now seen corresponding path program 4 times [2025-01-10 01:16:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643739337] [2025-01-10 01:16:48,069 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:16:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:48,079 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-01-10 01:16:48,135 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 01:16:48,135 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:16:48,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643739337] [2025-01-10 01:16:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643739337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192112385] [2025-01-10 01:16:52,737 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:16:52,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:52,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:52,743 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-01-10 01:16:52,750 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-01-10 01:16:52,808 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 106 statements into 2 equivalence classes. [2025-01-10 01:16:52,856 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 01:16:52,856 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:16:52,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:52,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-01-10 01:16:52,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:56,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192112385] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:00,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:17:00,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2025-01-10 01:17:00,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989729173] [2025-01-10 01:17:00,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:00,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2025-01-10 01:17:00,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:17:00,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2025-01-10 01:17:00,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15048, Invalid=25554, Unknown=0, NotChecked=0, Total=40602 [2025-01-10 01:17:00,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-01-10 01:17:00,088 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-01-10 01:17:00,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:00,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-01-10 01:17:00,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:07,185 INFO L124 PetriNetUnfolderBase]: 537/1089 cut-off events. [2025-01-10 01:17:07,185 INFO L125 PetriNetUnfolderBase]: For 139341/139341 co-relation queries the response was YES. [2025-01-10 01:17:07,190 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-01-10 01:17:07,193 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 317 selfloop transitions, 104 changer transitions 0/423 dead transitions. [2025-01-10 01:17:07,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 423 transitions, 2572 flow [2025-01-10 01:17:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-01-10 01:17:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-01-10 01:17:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1163 transitions. [2025-01-10 01:17:07,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819376026272578 [2025-01-10 01:17:07,199 INFO L175 Difference]: Start difference. First operand has 248 places, 110 transitions, 960 flow. Second operand 105 states and 1163 transitions. [2025-01-10 01:17:07,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 423 transitions, 2572 flow [2025-01-10 01:17:07,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 423 transitions, 2170 flow, removed 152 selfloop flow, removed 49 redundant places. [2025-01-10 01:17:07,317 INFO L231 Difference]: Finished difference. Result has 310 places, 117 transitions, 852 flow [2025-01-10 01:17:07,319 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-01-10 01:17:07,319 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 281 predicate places. [2025-01-10 01:17:07,320 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 117 transitions, 852 flow [2025-01-10 01:17:07,321 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-01-10 01:17:07,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:07,321 INFO L206 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:07,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:17:07,524 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-01-10 01:17:07,524 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-01-10 01:17:07,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1202437507, now seen corresponding path program 5 times [2025-01-10 01:17:07,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:17:07,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819393846] [2025-01-10 01:17:07,526 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:17:07,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:17:07,537 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 113 statements into 52 equivalence classes. [2025-01-10 01:17:07,581 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 01:17:07,581 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-01-10 01:17:07,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:17:07,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:17:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 01:17:07,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 01:17:07,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:07,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:17:07,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:17:07,656 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:17:07,656 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-01-10 01:17:07,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 01:17:07,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-10 01:17:07,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-10 01:17:07,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-01-10 01:17:07,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:17:07,658 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1] [2025-01-10 01:17:07,745 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:17:07,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:17:07,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:17:07 BasicIcfg [2025-01-10 01:17:07,750 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:17:07,750 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:17:07,751 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:17:07,751 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:17:07,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:26" (3/4) ... [2025-01-10 01:17:07,753 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 01:17:07,753 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:17:07,754 INFO L158 Benchmark]: Toolchain (without parser) took 42381.74ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 107.8MB in the beginning and 151.0MB in the end (delta: -43.3MB). Peak memory consumption was 208.6MB. Max. memory is 16.1GB. [2025-01-10 01:17:07,754 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:17:07,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.38ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 88.2MB in the end (delta: 19.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:17:07,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.78ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:17:07,754 INFO L158 Benchmark]: Boogie Preprocessor took 44.53ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:17:07,755 INFO L158 Benchmark]: RCFGBuilder took 313.98ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 65.9MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:17:07,755 INFO L158 Benchmark]: TraceAbstraction took 41675.46ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 65.9MB in the beginning and 151.1MB in the end (delta: -85.2MB). Peak memory consumption was 166.7MB. Max. memory is 16.1GB. [2025-01-10 01:17:07,755 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 394.3MB. Free memory was 151.1MB in the beginning and 151.0MB in the end (delta: 115.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:17:07,756 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 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.38ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 88.2MB in the end (delta: 19.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.78ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.53ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 313.98ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 65.9MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41675.46ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 65.9MB in the beginning and 151.1MB in the end (delta: -85.2MB). Peak memory consumption was 166.7MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 394.3MB. Free memory was 151.1MB in the beginning and 151.0MB in the end (delta: 115.4kB). 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=-2] [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=-2, t2=-1] [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: 41.5s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5778 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5769 mSDsluCounter, 495 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 492 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3219 IncrementalHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 3 mSDtfsCounter, 3219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1040 GetRequests, 152 SyntacticMatches, 94 SemanticMatches, 794 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57615 ImplicationChecksByTransitivity, 28.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=9, InterpolantAutomatonStates: 334, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 21.5s 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-01-10 01:17:07,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:17:09,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:17:09,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 01:17:09,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:17:09,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:17:09,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:17:09,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:17:09,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:17:09,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:17:09,595 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:17:09,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:17:09,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:17:09,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:17:09,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:17:09,596 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:17:09,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:17:09,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:17:09,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:17:09,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:17:09,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:17:09,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:17:09,598 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-01-10 01:17:09,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:17:09,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:17:09,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:17:09,835 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:17:09,835 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:17:09,835 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-01-10 01:17:10,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a2eb94e/afe29dde4aa3484e9c5b880cfe556f76/FLAGae1ed606e [2025-01-10 01:17:11,167 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:17:11,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-01-10 01:17:11,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a2eb94e/afe29dde4aa3484e9c5b880cfe556f76/FLAGae1ed606e [2025-01-10 01:17:11,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a2eb94e/afe29dde4aa3484e9c5b880cfe556f76 [2025-01-10 01:17:11,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:17:11,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:17:11,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:17:11,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:17:11,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:17:11,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31078f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11, skipping insertion in model container [2025-01-10 01:17:11,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:17:11,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:17:11,746 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:17:11,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:17:11,827 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:17:11,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11 WrapperNode [2025-01-10 01:17:11,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:17:11,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:17:11,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:17:11,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:17:11,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,861 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 54 [2025-01-10 01:17:11,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:17:11,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:17:11,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:17:11,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:17:11,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,887 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-01-10 01:17:11,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:17:11,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:17:11,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:17:11,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:17:11,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (1/1) ... [2025-01-10 01:17:11,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:17:11,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:11,931 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-01-10 01:17:11,933 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-01-10 01:17:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:17:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 01:17:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 01:17:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 01:17:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 01:17:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 01:17:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:17:11,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:17:11,950 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:17:12,028 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:17:12,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:17:12,122 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:17:12,122 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:17:12,215 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:17:12,215 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:17:12,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:17:12 BoogieIcfgContainer [2025-01-10 01:17:12,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:17:12,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:17:12,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:17:12,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:17:12,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:17:11" (1/3) ... [2025-01-10 01:17:12,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e608040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:17:12, skipping insertion in model container [2025-01-10 01:17:12,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:17:11" (2/3) ... [2025-01-10 01:17:12,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e608040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:17:12, skipping insertion in model container [2025-01-10 01:17:12,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:17:12" (3/3) ... [2025-01-10 01:17:12,225 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-01-10 01:17:12,236 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:17:12,238 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-01-10 01:17:12,238 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:17:12,270 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:17:12,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2025-01-10 01:17:12,319 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-01-10 01:17:12,320 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:17:12,322 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 36 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-01-10 01:17:12,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2025-01-10 01:17:12,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-01-10 01:17:12,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:17:12,334 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;@2179dccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:17:12,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 01:17:12,339 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:17:12,339 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2025-01-10 01:17:12,339 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:17:12,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:12,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:12,340 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-01-10 01:17:12,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1549092178, now seen corresponding path program 1 times [2025-01-10 01:17:12,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:12,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526624917] [2025-01-10 01:17:12,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:12,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:12,355 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-01-10 01:17:12,356 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-01-10 01:17:12,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:17:12,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:17:12,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:12,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:12,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:17:12,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:12,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:17:12,468 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526624917] [2025-01-10 01:17:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526624917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:17:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822575562] [2025-01-10 01:17:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:17:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:12,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:17:12,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:17:12,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2025-01-10 01:17:12,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:17:12,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:12,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2025-01-10 01:17:12,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:12,618 INFO L124 PetriNetUnfolderBase]: 124/273 cut-off events. [2025-01-10 01:17:12,618 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 01:17:12,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 273 events. 124/273 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1162 event pairs, 68 based on Foata normal form. 33/265 useless extension candidates. Maximal degree in co-relation 460. Up to 146 conditions per place. [2025-01-10 01:17:12,621 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 27 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2025-01-10 01:17:12,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2025-01-10 01:17:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:17:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:17:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-01-10 01:17:12,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-01-10 01:17:12,633 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 5 states and 80 transitions. [2025-01-10 01:17:12,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 163 flow [2025-01-10 01:17:12,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:17:12,639 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 80 flow [2025-01-10 01:17:12,644 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-01-10 01:17:12,645 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2025-01-10 01:17:12,645 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 80 flow [2025-01-10 01:17:12,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:17:12,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:12,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:12,660 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-01-10 01:17:12,850 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-01-10 01:17:12,853 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-01-10 01:17:12,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash 776231413, now seen corresponding path program 1 times [2025-01-10 01:17:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:12,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548566555] [2025-01-10 01:17:12,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:12,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:12,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:12,859 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-01-10 01:17:12,860 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-01-10 01:17:12,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:17:12,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:17:12,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:12,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:12,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:17:12,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:12,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:17:12,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548566555] [2025-01-10 01:17:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548566555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:12,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:12,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:17:12,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976044072] [2025-01-10 01:17:12,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:17:12,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:12,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:17:12,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:17:12,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-01-10 01:17:12,982 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-01-10 01:17:12,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:12,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-01-10 01:17:12,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:13,142 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2025-01-10 01:17:13,142 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-01-10 01:17:13,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 247 events. 111/247 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 937 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-01-10 01:17:13,144 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2025-01-10 01:17:13,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 216 flow [2025-01-10 01:17:13,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:17:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:17:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-01-10 01:17:13,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-01-10 01:17:13,145 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 80 flow. Second operand 5 states and 73 transitions. [2025-01-10 01:17:13,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 216 flow [2025-01-10 01:17:13,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:17:13,147 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 111 flow [2025-01-10 01:17:13,147 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-01-10 01:17:13,147 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2025-01-10 01:17:13,147 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 111 flow [2025-01-10 01:17:13,148 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-01-10 01:17:13,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:13,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:13,166 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-01-10 01:17:13,357 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-01-10 01:17:13,357 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-01-10 01:17:13,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:13,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1799176979, now seen corresponding path program 1 times [2025-01-10 01:17:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582606003] [2025-01-10 01:17:13,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:13,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:13,360 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-01-10 01:17:13,371 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-01-10 01:17:13,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:17:13,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:17:13,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:13,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:13,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:17:13,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:13,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:13,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:13,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582606003] [2025-01-10 01:17:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582606003] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:13,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:17:13,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-01-10 01:17:13,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618534655] [2025-01-10 01:17:13,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:13,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:17:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:13,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:17:13,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:17:13,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-01-10 01:17:13,547 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-01-10 01:17:13,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:13,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-01-10 01:17:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:13,820 INFO L124 PetriNetUnfolderBase]: 163/372 cut-off events. [2025-01-10 01:17:13,820 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-01-10 01:17:13,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 372 events. 163/372 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1618 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-01-10 01:17:13,822 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2025-01-10 01:17:13,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 375 flow [2025-01-10 01:17:13,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:17:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:17:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2025-01-10 01:17:13,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445141065830721 [2025-01-10 01:17:13,827 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 111 flow. Second operand 11 states and 142 transitions. [2025-01-10 01:17:13,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 375 flow [2025-01-10 01:17:13,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:17:13,830 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 196 flow [2025-01-10 01:17:13,830 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-01-10 01:17:13,831 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2025-01-10 01:17:13,831 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 196 flow [2025-01-10 01:17:13,831 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-01-10 01:17:13,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:13,832 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:13,838 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-01-10 01:17:14,032 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-01-10 01:17:14,033 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-01-10 01:17:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash -125718476, now seen corresponding path program 1 times [2025-01-10 01:17:14,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629456367] [2025-01-10 01:17:14,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:14,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:14,036 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-01-10 01:17:14,037 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-01-10 01:17:14,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:17:14,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:17:14,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:14,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:17:14,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:14,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:14,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:14,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629456367] [2025-01-10 01:17:14,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629456367] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:14,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:17:14,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-10 01:17:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781375256] [2025-01-10 01:17:14,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:14,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:17:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:14,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:17:14,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:17:14,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:17:14,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 196 flow. Second operand has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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-01-10 01:17:14,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:14,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:17:14,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:14,537 INFO L124 PetriNetUnfolderBase]: 291/634 cut-off events. [2025-01-10 01:17:14,537 INFO L125 PetriNetUnfolderBase]: For 580/588 co-relation queries the response was YES. [2025-01-10 01:17:14,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 634 events. 291/634 cut-off events. For 580/588 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3038 event pairs, 61 based on Foata normal form. 38/656 useless extension candidates. Maximal degree in co-relation 1243. Up to 134 conditions per place. [2025-01-10 01:17:14,540 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 66 selfloop transitions, 28 changer transitions 0/102 dead transitions. [2025-01-10 01:17:14,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 605 flow [2025-01-10 01:17:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:17:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:17:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 209 transitions. [2025-01-10 01:17:14,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4804597701149425 [2025-01-10 01:17:14,542 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 196 flow. Second operand 15 states and 209 transitions. [2025-01-10 01:17:14,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 605 flow [2025-01-10 01:17:14,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 102 transitions, 558 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-10 01:17:14,548 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 339 flow [2025-01-10 01:17:14,548 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-01-10 01:17:14,549 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2025-01-10 01:17:14,549 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 339 flow [2025-01-10 01:17:14,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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-01-10 01:17:14,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:14,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:14,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:17:14,754 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-01-10 01:17:14,754 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-01-10 01:17:14,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2002552833, now seen corresponding path program 1 times [2025-01-10 01:17:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:14,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307954106] [2025-01-10 01:17:14,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:14,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:14,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:14,757 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-01-10 01:17:14,759 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-01-10 01:17:14,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:17:14,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:17:14,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:14,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:14,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:17:14,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:14,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:17:14,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:14,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307954106] [2025-01-10 01:17:14,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307954106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:14,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:14,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:17:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746737790] [2025-01-10 01:17:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:14,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:17:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:14,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:17:14,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:17:14,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:17:14,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-10 01:17:14,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:14,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:17:14,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:14,891 INFO L124 PetriNetUnfolderBase]: 233/564 cut-off events. [2025-01-10 01:17:14,891 INFO L125 PetriNetUnfolderBase]: For 1024/1024 co-relation queries the response was YES. [2025-01-10 01:17:14,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 564 events. 233/564 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2850 event pairs, 223 based on Foata normal form. 10/556 useless extension candidates. Maximal degree in co-relation 1687. Up to 472 conditions per place. [2025-01-10 01:17:14,893 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 27 selfloop transitions, 1 changer transitions 17/50 dead transitions. [2025-01-10 01:17:14,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 50 transitions, 419 flow [2025-01-10 01:17:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:17:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:17:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-01-10 01:17:14,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2025-01-10 01:17:14,894 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 339 flow. Second operand 3 states and 41 transitions. [2025-01-10 01:17:14,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 50 transitions, 419 flow [2025-01-10 01:17:14,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 322 flow, removed 36 selfloop flow, removed 7 redundant places. [2025-01-10 01:17:14,899 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 153 flow [2025-01-10 01:17:14,899 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-01-10 01:17:14,900 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2025-01-10 01:17:14,900 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 153 flow [2025-01-10 01:17:14,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-10 01:17:14,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:14,900 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:14,910 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-01-10 01:17:15,101 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-01-10 01:17:15,101 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-01-10 01:17:15,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2078954516, now seen corresponding path program 2 times [2025-01-10 01:17:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:15,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866416900] [2025-01-10 01:17:15,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:17:15,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:15,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:15,106 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-01-10 01:17:15,107 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-01-10 01:17:15,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:17:15,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:17:15,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:17:15,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:15,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:17:15,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:15,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:15,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866416900] [2025-01-10 01:17:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866416900] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:15,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:17:15,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-01-10 01:17:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3011663] [2025-01-10 01:17:15,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:15,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:17:15,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:15,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:17:15,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:17:15,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:17:15,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 153 flow. Second operand has 20 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 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-01-10 01:17:15,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:15,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:17:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:16,570 INFO L124 PetriNetUnfolderBase]: 365/758 cut-off events. [2025-01-10 01:17:16,570 INFO L125 PetriNetUnfolderBase]: For 1044/1044 co-relation queries the response was YES. [2025-01-10 01:17:16,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 758 events. 365/758 cut-off events. For 1044/1044 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3316 event pairs, 45 based on Foata normal form. 80/830 useless extension candidates. Maximal degree in co-relation 2131. Up to 191 conditions per place. [2025-01-10 01:17:16,572 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 55 selfloop transitions, 31 changer transitions 44/134 dead transitions. [2025-01-10 01:17:16,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 742 flow [2025-01-10 01:17:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 01:17:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 01:17:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 330 transitions. [2025-01-10 01:17:16,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4376657824933687 [2025-01-10 01:17:16,574 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 153 flow. Second operand 26 states and 330 transitions. [2025-01-10 01:17:16,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 742 flow [2025-01-10 01:17:16,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 690 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-01-10 01:17:16,577 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 331 flow [2025-01-10 01:17:16,577 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-01-10 01:17:16,577 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2025-01-10 01:17:16,577 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 331 flow [2025-01-10 01:17:16,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 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-01-10 01:17:16,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:16,578 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:16,584 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-01-10 01:17:16,778 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-01-10 01:17:16,779 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-01-10 01:17:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash 587543444, now seen corresponding path program 3 times [2025-01-10 01:17:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:16,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113880261] [2025-01-10 01:17:16,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:17:16,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:16,783 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-01-10 01:17:16,784 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-01-10 01:17:16,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 8 equivalence classes. [2025-01-10 01:17:16,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-01-10 01:17:16,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:17:16,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:16,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:17:16,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-10 01:17:16,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-10 01:17:17,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113880261] [2025-01-10 01:17:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113880261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:17,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:17:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2025-01-10 01:17:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934202530] [2025-01-10 01:17:17,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:17,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:17:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:17,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:17:17,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:17:17,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2025-01-10 01:17:17,350 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-01-10 01:17:17,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:17,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2025-01-10 01:17:17,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:17,709 INFO L124 PetriNetUnfolderBase]: 196/406 cut-off events. [2025-01-10 01:17:17,709 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2025-01-10 01:17:17,709 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 1322 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-01-10 01:17:17,710 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 30 selfloop transitions, 4 changer transitions 33/69 dead transitions. [2025-01-10 01:17:17,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 532 flow [2025-01-10 01:17:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:17:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:17:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-01-10 01:17:17,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.367816091954023 [2025-01-10 01:17:17,713 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 331 flow. Second operand 9 states and 96 transitions. [2025-01-10 01:17:17,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 532 flow [2025-01-10 01:17:17,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 427 flow, removed 40 selfloop flow, removed 15 redundant places. [2025-01-10 01:17:17,716 INFO L231 Difference]: Finished difference. Result has 60 places, 30 transitions, 149 flow [2025-01-10 01:17:17,716 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-01-10 01:17:17,716 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2025-01-10 01:17:17,716 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 30 transitions, 149 flow [2025-01-10 01:17:17,716 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-01-10 01:17:17,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:17,716 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:17,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:17:17,921 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-01-10 01:17:17,921 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-01-10 01:17:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash 390070132, now seen corresponding path program 2 times [2025-01-10 01:17:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243092499] [2025-01-10 01:17:17,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:17:17,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:17,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:17,924 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-01-10 01:17:17,926 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-01-10 01:17:17,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:17:17,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:17:17,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:17:17,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:17,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:17:17,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:18,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:18,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:18,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243092499] [2025-01-10 01:17:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243092499] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:18,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:17:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2025-01-10 01:17:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779450870] [2025-01-10 01:17:18,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:18,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-10 01:17:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:18,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-10 01:17:18,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=934, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:17:19,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:17:19,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 30 transitions, 149 flow. Second operand has 36 states, 36 states have (on average 9.277777777777779) internal successors, (334), 36 states have internal predecessors, (334), 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-01-10 01:17:19,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:19,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:17:19,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:22,195 INFO L124 PetriNetUnfolderBase]: 259/535 cut-off events. [2025-01-10 01:17:22,195 INFO L125 PetriNetUnfolderBase]: For 3251/3251 co-relation queries the response was YES. [2025-01-10 01:17:22,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 535 events. 259/535 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1541 event pairs, 24 based on Foata normal form. 80/613 useless extension candidates. Maximal degree in co-relation 2301. Up to 176 conditions per place. [2025-01-10 01:17:22,197 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 101 selfloop transitions, 32 changer transitions 64/200 dead transitions. [2025-01-10 01:17:22,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 200 transitions, 1345 flow [2025-01-10 01:17:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-10 01:17:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-01-10 01:17:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 605 transitions. [2025-01-10 01:17:22,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4257565095003519 [2025-01-10 01:17:22,199 INFO L175 Difference]: Start difference. First operand has 60 places, 30 transitions, 149 flow. Second operand 49 states and 605 transitions. [2025-01-10 01:17:22,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 200 transitions, 1345 flow [2025-01-10 01:17:22,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 200 transitions, 1277 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-01-10 01:17:22,203 INFO L231 Difference]: Finished difference. Result has 124 places, 46 transitions, 403 flow [2025-01-10 01:17:22,203 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-01-10 01:17:22,203 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2025-01-10 01:17:22,203 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 46 transitions, 403 flow [2025-01-10 01:17:22,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.277777777777779) internal successors, (334), 36 states have internal predecessors, (334), 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-01-10 01:17:22,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:22,204 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:22,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:17:22,404 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-01-10 01:17:22,404 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-01-10 01:17:22,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:22,405 INFO L85 PathProgramCache]: Analyzing trace with hash -681869708, now seen corresponding path program 3 times [2025-01-10 01:17:22,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:22,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431516304] [2025-01-10 01:17:22,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:17:22,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:22,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:22,406 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-01-10 01:17:22,408 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-01-10 01:17:22,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 16 equivalence classes. [2025-01-10 01:17:22,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:17:22,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-01-10 01:17:22,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:22,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 01:17:22,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:23,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:25,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431516304] [2025-01-10 01:17:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431516304] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:25,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:17:25,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2025-01-10 01:17:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193146353] [2025-01-10 01:17:25,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:25,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-01-10 01:17:25,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:25,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-01-10 01:17:25,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1158, Invalid=3398, Unknown=0, NotChecked=0, Total=4556 [2025-01-10 01:17:27,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:17:27,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 46 transitions, 403 flow. Second operand has 68 states, 68 states have (on average 9.147058823529411) internal successors, (622), 68 states have internal predecessors, (622), 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-01-10 01:17:27,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:27,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:17:27,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:41,957 INFO L124 PetriNetUnfolderBase]: 499/1015 cut-off events. [2025-01-10 01:17:41,957 INFO L125 PetriNetUnfolderBase]: For 65520/65520 co-relation queries the response was YES. [2025-01-10 01:17:41,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7467 conditions, 1015 events. 499/1015 cut-off events. For 65520/65520 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3117 event pairs, 24 based on Foata normal form. 160/1173 useless extension candidates. Maximal degree in co-relation 7418. Up to 416 conditions per place. [2025-01-10 01:17:41,977 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 197 selfloop transitions, 64 changer transitions 128/392 dead transitions. [2025-01-10 01:17:41,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 392 transitions, 3823 flow [2025-01-10 01:17:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-01-10 01:17:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2025-01-10 01:17:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 1197 transitions. [2025-01-10 01:17:41,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4255243512264486 [2025-01-10 01:17:41,987 INFO L175 Difference]: Start difference. First operand has 124 places, 46 transitions, 403 flow. Second operand 97 states and 1197 transitions. [2025-01-10 01:17:41,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 392 transitions, 3823 flow [2025-01-10 01:17:42,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 392 transitions, 3565 flow, removed 113 selfloop flow, removed 32 redundant places. [2025-01-10 01:17:42,064 INFO L231 Difference]: Finished difference. Result has 236 places, 78 transitions, 787 flow [2025-01-10 01:17:42,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=787, PETRI_PLACES=236, PETRI_TRANSITIONS=78} [2025-01-10 01:17:42,065 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 207 predicate places. [2025-01-10 01:17:42,065 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 78 transitions, 787 flow [2025-01-10 01:17:42,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 9.147058823529411) internal successors, (622), 68 states have internal predecessors, (622), 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-01-10 01:17:42,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:42,066 INFO L206 CegarLoopForPetriNet]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:42,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:17:42,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:42,267 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-01-10 01:17:42,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash -520586124, now seen corresponding path program 4 times [2025-01-10 01:17:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804918039] [2025-01-10 01:17:42,274 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:17:42,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:42,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:42,275 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:17:42,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:17:42,321 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 74 statements into 2 equivalence classes. [2025-01-10 01:17:42,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:17:42,374 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:17:42,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:42,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-01-10 01:17:42,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:44,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:17:51,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804918039] [2025-01-10 01:17:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804918039] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:51,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:17:51,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 131 [2025-01-10 01:17:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992183000] [2025-01-10 01:17:51,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:51,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-01-10 01:17:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:51,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-01-10 01:17:51,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4058, Invalid=13234, Unknown=0, NotChecked=0, Total=17292 [2025-01-10 01:17:56,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-01-10 01:17:56,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 78 transitions, 787 flow. Second operand has 132 states, 132 states have (on average 9.075757575757576) internal successors, (1198), 132 states have internal predecessors, (1198), 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-01-10 01:17:56,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:56,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-01-10 01:17:56,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand