./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-1.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/unwind3-1.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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:16:47,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:16:47,267 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:47,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:16:47,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:16:47,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:16:47,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:16:47,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:16:47,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:16:47,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:16:47,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:16:47,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:16:47,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:16:47,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:16:47,307 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:16:47,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:16:47,307 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:16:47,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:16:47,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:16:47,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:16:47,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:16:47,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:16:47,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:47,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:47,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:47,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:47,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:16:47,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:47,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:47,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:47,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:47,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:16:47,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:16:47,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:16:47,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:16:47,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:16:47,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:16:47,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:16:47,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:16:47,311 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2025-01-10 01:16:47,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:16:47,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:16:47,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:16:47,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:16:47,595 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:16:47,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-01-10 01:16:48,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0de1a948c/a9eaabafa1b54c90bef702d992a18262/FLAG1cb6247fc [2025-01-10 01:16:49,233 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:16:49,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-01-10 01:16:49,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0de1a948c/a9eaabafa1b54c90bef702d992a18262/FLAG1cb6247fc [2025-01-10 01:16:49,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0de1a948c/a9eaabafa1b54c90bef702d992a18262 [2025-01-10 01:16:49,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:16:49,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:16:49,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:49,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:16:49,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:16:49,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:49" (1/1) ... [2025-01-10 01:16:49,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25614076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:49, skipping insertion in model container [2025-01-10 01:16:49,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:49" (1/1) ... [2025-01-10 01:16:49,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:16:49,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:49,632 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:16:49,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:49,719 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:16:49,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:49 WrapperNode [2025-01-10 01:16:49,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:49,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:49,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:16:49,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:16:49,730 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:49" (1/1) ... [2025-01-10 01:16:49,746 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:49" (1/1) ... [2025-01-10 01:16:49,763 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2025-01-10 01:16:49,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:49,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:16:49,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:16:49,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:16:49,770 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:49" (1/1) ... [2025-01-10 01:16:49,770 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:49" (1/1) ... [2025-01-10 01:16:49,772 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:49" (1/1) ... [2025-01-10 01:16:49,784 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:49,784 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:49" (1/1) ... [2025-01-10 01:16:49,784 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:49" (1/1) ... [2025-01-10 01:16:49,788 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:49" (1/1) ... [2025-01-10 01:16:49,789 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:49" (1/1) ... [2025-01-10 01:16:49,794 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:49" (1/1) ... [2025-01-10 01:16:49,795 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:49" (1/1) ... [2025-01-10 01:16:49,799 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:49" (1/1) ... [2025-01-10 01:16:49,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:16:49,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:16:49,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:16:49,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:16:49,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:49" (1/1) ... [2025-01-10 01:16:49,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:49,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:49,831 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:49,833 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:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:16:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 01:16:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 01:16:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 01:16:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 01:16:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:16:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:16:49,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:16:49,852 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:49,947 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:16:49,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:16:50,071 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:16:50,071 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:16:50,155 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:16:50,155 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:16:50,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:50 BoogieIcfgContainer [2025-01-10 01:16:50,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:16:50,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:16:50,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:16:50,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:16:50,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:16:49" (1/3) ... [2025-01-10 01:16:50,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0d64cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:50, skipping insertion in model container [2025-01-10 01:16:50,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:49" (2/3) ... [2025-01-10 01:16:50,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0d64cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:50, skipping insertion in model container [2025-01-10 01:16:50,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:50" (3/3) ... [2025-01-10 01:16:50,165 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2025-01-10 01:16:50,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:16:50,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-1.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 01:16:50,178 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:16:50,228 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:50,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-01-10 01:16:50,301 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-01-10 01:16:50,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:50,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-01-10 01:16:50,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-01-10 01:16:50,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-01-10 01:16:50,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:50,328 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;@3737bebe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:50,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 01:16:50,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:50,335 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-10 01:16:50,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:50,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:50,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:50,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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:50,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2030658168, now seen corresponding path program 1 times [2025-01-10 01:16:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914339045] [2025-01-10 01:16:50,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:50,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:16:50,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:16:50,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:50,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:50,588 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:50,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914339045] [2025-01-10 01:16:50,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914339045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:50,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:50,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:50,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928515109] [2025-01-10 01:16:50,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:50,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:50,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:50,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:50,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:16:50,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:50,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:50,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:16:50,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:50,769 INFO L124 PetriNetUnfolderBase]: 69/163 cut-off events. [2025-01-10 01:16:50,769 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:16:50,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 163 events. 69/163 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 613 event pairs, 41 based on Foata normal form. 18/166 useless extension candidates. Maximal degree in co-relation 287. Up to 124 conditions per place. [2025-01-10 01:16:50,772 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 16 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-01-10 01:16:50,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 97 flow [2025-01-10 01:16:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-01-10 01:16:50,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:16:50,783 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 54 transitions. [2025-01-10 01:16:50,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 97 flow [2025-01-10 01:16:50,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:50,788 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2025-01-10 01:16:50,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-01-10 01:16:50,794 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-01-10 01:16:50,794 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2025-01-10 01:16:50,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:50,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:50,794 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:50,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:16:50,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:16:50,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1475079309, now seen corresponding path program 1 times [2025-01-10 01:16:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133522694] [2025-01-10 01:16:50,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:50,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:16:50,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:16:50,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:50,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:50,910 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:50,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:50,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133522694] [2025-01-10 01:16:50,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133522694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:50,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:50,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85899360] [2025-01-10 01:16:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:50,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:50,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:50,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:50,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:16:50,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:50,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:50,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:16:50,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:51,017 INFO L124 PetriNetUnfolderBase]: 67/156 cut-off events. [2025-01-10 01:16:51,017 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:16:51,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 156 events. 67/156 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 577 event pairs, 24 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 286. Up to 114 conditions per place. [2025-01-10 01:16:51,019 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 16 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2025-01-10 01:16:51,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 107 flow [2025-01-10 01:16:51,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:16:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:16:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-01-10 01:16:51,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-01-10 01:16:51,024 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 62 flow. Second operand 5 states and 61 transitions. [2025-01-10 01:16:51,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 107 flow [2025-01-10 01:16:51,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:16:51,026 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 64 flow [2025-01-10 01:16:51,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2025-01-10 01:16:51,027 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-01-10 01:16:51,027 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 64 flow [2025-01-10 01:16:51,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:51,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:51,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:51,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:16:51,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:51,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 211983488, now seen corresponding path program 1 times [2025-01-10 01:16:51,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:51,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640341890] [2025-01-10 01:16:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:51,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:16:51,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:16:51,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:51,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:51,086 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:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640341890] [2025-01-10 01:16:51,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640341890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:51,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:51,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:51,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482291954] [2025-01-10 01:16:51,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:51,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:51,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:51,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:51,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:16:51,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:51,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:51,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:16:51,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:51,162 INFO L124 PetriNetUnfolderBase]: 67/150 cut-off events. [2025-01-10 01:16:51,162 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 01:16:51,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 150 events. 67/150 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 522 event pairs, 58 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 286. Up to 123 conditions per place. [2025-01-10 01:16:51,163 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 13 selfloop transitions, 1 changer transitions 1/21 dead transitions. [2025-01-10 01:16:51,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 92 flow [2025-01-10 01:16:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-01-10 01:16:51,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2025-01-10 01:16:51,165 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 64 flow. Second operand 3 states and 40 transitions. [2025-01-10 01:16:51,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 92 flow [2025-01-10 01:16:51,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 82 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 01:16:51,166 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 52 flow [2025-01-10 01:16:51,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2025-01-10 01:16:51,166 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2025-01-10 01:16:51,166 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 52 flow [2025-01-10 01:16:51,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:51,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:51,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:51,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:16:51,167 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:51,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1602619734, now seen corresponding path program 1 times [2025-01-10 01:16:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108685591] [2025-01-10 01:16:51,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:51,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:16:51,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:16:51,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:51,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:51,288 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:51,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:51,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108685591] [2025-01-10 01:16:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108685591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:51,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:51,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474979796] [2025-01-10 01:16:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:51,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:51,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:51,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:51,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:51,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-01-10 01:16:51,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:51,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:51,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-01-10 01:16:51,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:51,423 INFO L124 PetriNetUnfolderBase]: 95/207 cut-off events. [2025-01-10 01:16:51,423 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:16:51,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 207 events. 95/207 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 758 event pairs, 35 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 394. Up to 83 conditions per place. [2025-01-10 01:16:51,426 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 27 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2025-01-10 01:16:51,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 162 flow [2025-01-10 01:16:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:16:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:16:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2025-01-10 01:16:51,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-01-10 01:16:51,427 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 52 flow. Second operand 6 states and 78 transitions. [2025-01-10 01:16:51,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 162 flow [2025-01-10 01:16:51,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:51,429 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 92 flow [2025-01-10 01:16:51,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2025-01-10 01:16:51,433 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2025-01-10 01:16:51,433 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 92 flow [2025-01-10 01:16:51,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:51,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:51,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:51,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:16:51,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:51,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1859381646, now seen corresponding path program 1 times [2025-01-10 01:16:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:51,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162153061] [2025-01-10 01:16:51,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:51,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:51,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:16:51,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:16:51,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:51,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:51,567 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:51,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162153061] [2025-01-10 01:16:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162153061] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006084588] [2025-01-10 01:16:51,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:51,585 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:51,587 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:51,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:16:51,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:16:51,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:51,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:51,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:16:51,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:51,805 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:51,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:16:51,869 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:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006084588] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:16:51,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:16:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:16:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610788327] [2025-01-10 01:16:51,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:16:51,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:16:51,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:51,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:16:51,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:16:51,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:16:51,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 92 flow. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 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:51,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:51,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:16:51,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:52,076 INFO L124 PetriNetUnfolderBase]: 142/279 cut-off events. [2025-01-10 01:16:52,077 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-10 01:16:52,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 279 events. 142/279 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1076 event pairs, 43 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 697. Up to 102 conditions per place. [2025-01-10 01:16:52,082 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 20 selfloop transitions, 7 changer transitions 16/49 dead transitions. [2025-01-10 01:16:52,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 244 flow [2025-01-10 01:16:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:16:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:16:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2025-01-10 01:16:52,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2025-01-10 01:16:52,083 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 92 flow. Second operand 8 states and 106 transitions. [2025-01-10 01:16:52,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 244 flow [2025-01-10 01:16:52,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 235 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:52,087 INFO L231 Difference]: Finished difference. Result has 43 places, 25 transitions, 126 flow [2025-01-10 01:16:52,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=25} [2025-01-10 01:16:52,087 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2025-01-10 01:16:52,088 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 126 flow [2025-01-10 01:16:52,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 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:52,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:52,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,098 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:52,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:52,289 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:52,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1807242026, now seen corresponding path program 2 times [2025-01-10 01:16:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:52,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022761240] [2025-01-10 01:16:52,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:16:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:52,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:16:52,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:16:52,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:16:52,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:52,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022761240] [2025-01-10 01:16:52,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022761240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:16:52,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091544489] [2025-01-10 01:16:52,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:16:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:52,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:52,394 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:52,396 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:52,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:16:52,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:16:52,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:16:52,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:52,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:16:52,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:52,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:16:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091544489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:52,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:16:52,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 01:16:52,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694682290] [2025-01-10 01:16:52,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:52,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:16:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:52,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:16:52,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:16:52,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-01-10 01:16:52,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 25 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:52,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:52,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-01-10 01:16:52,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:52,679 INFO L124 PetriNetUnfolderBase]: 84/178 cut-off events. [2025-01-10 01:16:52,680 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2025-01-10 01:16:52,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 178 events. 84/178 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 530 event pairs, 20 based on Foata normal form. 12/190 useless extension candidates. Maximal degree in co-relation 538. Up to 93 conditions per place. [2025-01-10 01:16:52,681 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 21 selfloop transitions, 2 changer transitions 17/43 dead transitions. [2025-01-10 01:16:52,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 250 flow [2025-01-10 01:16:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:16:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:16:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-01-10 01:16:52,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-10 01:16:52,683 INFO L175 Difference]: Start difference. First operand has 43 places, 25 transitions, 126 flow. Second operand 8 states and 96 transitions. [2025-01-10 01:16:52,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 250 flow [2025-01-10 01:16:52,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 237 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 01:16:52,686 INFO L231 Difference]: Finished difference. Result has 45 places, 21 transitions, 92 flow [2025-01-10 01:16:52,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=21} [2025-01-10 01:16:52,687 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2025-01-10 01:16:52,687 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 21 transitions, 92 flow [2025-01-10 01:16:52,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:52,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:52,687 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:16:52,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:52,888 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:52,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1181440093, now seen corresponding path program 1 times [2025-01-10 01:16:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492807297] [2025-01-10 01:16:52,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:52,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:16:52,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:16:52,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:52,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:52,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:16:52,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:16:52,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:52,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:52,936 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:52,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-01-10 01:16:52,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 01:16:52,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-10 01:16:52,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-10 01:16:52,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-01-10 01:16:52,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:16:52,941 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,973 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:16:52,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:16:52,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:16:52 BasicIcfg [2025-01-10 01:16:52,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:16:52,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:16:52,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:16:52,979 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:16:52,980 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:50" (3/4) ... [2025-01-10 01:16:52,981 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 01:16:52,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:16:52,987 INFO L158 Benchmark]: Toolchain (without parser) took 3721.97ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 99.3MB in the end (delta: 11.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2025-01-10 01:16:52,987 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:16:52,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.80ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 90.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:16:52,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.33ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:16:52,987 INFO L158 Benchmark]: Boogie Preprocessor took 36.62ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:16:52,988 INFO L158 Benchmark]: RCFGBuilder took 355.33ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 68.8MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:16:52,988 INFO L158 Benchmark]: TraceAbstraction took 2819.30ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 99.3MB in the end (delta: -31.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:16:52,988 INFO L158 Benchmark]: Witness Printer took 6.77ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 99.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:16:52,989 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.26ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.80ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 90.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.33ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.62ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 355.33ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 68.8MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2819.30ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 99.3MB in the end (delta: -31.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.77ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 99.3MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-2] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=-1] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 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: 2.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 400 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 8 mSDtfsCounter, 400 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 325 SizeOfPredicates, 5 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 5/9 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:16:53,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-1.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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:16:55,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:16:55,492 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:16:55,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:16:55,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:16:55,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:16:55,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:16:55,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:16:55,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:16:55,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:16:55,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:16:55,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:16:55,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:16:55,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:16:55,528 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:16:55,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:16:55,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:16:55,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:16:55,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:16:55,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:16:55,529 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:16:55,529 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:16:55,529 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:16:55,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:16:55,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:16:55,529 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:16:55,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:55,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:55,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:55,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:55,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:16:55,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:16:55,531 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 01:16:55,531 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 01:16:55,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:16:55,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:16:55,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:16:55,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:16:55,531 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2025-01-10 01:16:55,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:16:55,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:16:55,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:16:55,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:16:55,849 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:16:55,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-01-10 01:16:57,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8630c849f/e7cd3159d88f43f3ac674812aa444c98/FLAGdc01081af [2025-01-10 01:16:57,554 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:16:57,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-01-10 01:16:57,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8630c849f/e7cd3159d88f43f3ac674812aa444c98/FLAGdc01081af [2025-01-10 01:16:57,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8630c849f/e7cd3159d88f43f3ac674812aa444c98 [2025-01-10 01:16:57,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:16:57,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:16:57,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:57,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:16:57,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:16:57,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:57" (1/1) ... [2025-01-10 01:16:57,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9580bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:57, skipping insertion in model container [2025-01-10 01:16:57,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:57" (1/1) ... [2025-01-10 01:16:57,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:16:57,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:57,958 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:16:58,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:58,044 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:16:58,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:58 WrapperNode [2025-01-10 01:16:58,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:58,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:58,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:16:58,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:16:58,053 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:58" (1/1) ... [2025-01-10 01:16:58,075 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:58" (1/1) ... [2025-01-10 01:16:58,098 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2025-01-10 01:16:58,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:58,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:16:58,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:16:58,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:16:58,107 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:58" (1/1) ... [2025-01-10 01:16:58,107 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:58" (1/1) ... [2025-01-10 01:16:58,112 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:58" (1/1) ... [2025-01-10 01:16:58,132 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:58,132 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:58" (1/1) ... [2025-01-10 01:16:58,132 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:58" (1/1) ... [2025-01-10 01:16:58,140 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:58" (1/1) ... [2025-01-10 01:16:58,144 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:58" (1/1) ... [2025-01-10 01:16:58,146 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:58" (1/1) ... [2025-01-10 01:16:58,152 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:58" (1/1) ... [2025-01-10 01:16:58,153 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:58" (1/1) ... [2025-01-10 01:16:58,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:16:58,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:16:58,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:16:58,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:16:58,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:58" (1/1) ... [2025-01-10 01:16:58,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:58,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:58,203 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:58,210 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:58,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:16:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 01:16:58,232 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 01:16:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 01:16:58,232 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 01:16:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 01:16:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:16:58,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:16:58,234 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:58,358 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:16:58,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:16:58,508 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:16:58,508 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:16:58,637 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:16:58,638 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:16:58,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:58 BoogieIcfgContainer [2025-01-10 01:16:58,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:16:58,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:16:58,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:16:58,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:16:58,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:16:57" (1/3) ... [2025-01-10 01:16:58,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124a97ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:58, skipping insertion in model container [2025-01-10 01:16:58,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:58" (2/3) ... [2025-01-10 01:16:58,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124a97ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:58, skipping insertion in model container [2025-01-10 01:16:58,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:58" (3/3) ... [2025-01-10 01:16:58,652 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2025-01-10 01:16:58,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:16:58,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-1.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 01:16:58,669 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:16:58,732 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:58,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-01-10 01:16:58,812 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-01-10 01:16:58,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:58,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-01-10 01:16:58,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-01-10 01:16:58,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-01-10 01:16:58,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:58,844 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;@11162ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:58,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 01:16:58,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:58,854 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-10 01:16:58,854 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:58,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:58,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:58,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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:58,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash -196483894, now seen corresponding path program 1 times [2025-01-10 01:16:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:16:58,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269662167] [2025-01-10 01:16:58,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:58,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:58,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:58,878 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:58,880 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:58,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:16:58,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:16:58,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:58,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:58,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:16:58,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:59,008 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:59,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:16:59,010 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:16:59,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269662167] [2025-01-10 01:16:59,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269662167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:59,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:59,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769080658] [2025-01-10 01:16:59,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:59,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:59,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:16:59,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:59,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:59,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:16:59,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:59,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:59,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:16:59,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:59,138 INFO L124 PetriNetUnfolderBase]: 80/198 cut-off events. [2025-01-10 01:16:59,139 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:16:59,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 198 events. 80/198 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 813 event pairs, 68 based on Foata normal form. 24/198 useless extension candidates. Maximal degree in co-relation 288. Up to 155 conditions per place. [2025-01-10 01:16:59,144 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 13 selfloop transitions, 1 changer transitions 1/22 dead transitions. [2025-01-10 01:16:59,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 81 flow [2025-01-10 01:16:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-01-10 01:16:59,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-01-10 01:16:59,158 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 3 states and 42 transitions. [2025-01-10 01:16:59,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 81 flow [2025-01-10 01:16:59,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 22 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:59,163 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 50 flow [2025-01-10 01:16:59,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2025-01-10 01:16:59,168 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2025-01-10 01:16:59,168 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 50 flow [2025-01-10 01:16:59,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:59,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:59,168 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:59,178 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:59,369 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:16:59,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:16:59,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1795060339, now seen corresponding path program 1 times [2025-01-10 01:16:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:16:59,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385255037] [2025-01-10 01:16:59,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:59,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:59,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:59,374 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:59,375 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:59,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:16:59,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:16:59,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:59,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:59,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:16:59,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:59,526 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:59,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:16:59,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:16:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385255037] [2025-01-10 01:16:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385255037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:59,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622014085] [2025-01-10 01:16:59,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:59,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:16:59,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:59,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:59,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:16:59,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:59,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:59,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:16:59,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:59,642 INFO L124 PetriNetUnfolderBase]: 55/129 cut-off events. [2025-01-10 01:16:59,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:59,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 129 events. 55/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 431 event pairs, 18 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 238. Up to 93 conditions per place. [2025-01-10 01:16:59,645 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 15 selfloop transitions, 4 changer transitions 0/24 dead transitions. [2025-01-10 01:16:59,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 93 flow [2025-01-10 01:16:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:16:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:16:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-01-10 01:16:59,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-01-10 01:16:59,647 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 50 flow. Second operand 5 states and 61 transitions. [2025-01-10 01:16:59,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 93 flow [2025-01-10 01:16:59,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 91 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:59,649 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 57 flow [2025-01-10 01:16:59,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=57, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2025-01-10 01:16:59,649 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2025-01-10 01:16:59,651 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 57 flow [2025-01-10 01:16:59,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:59,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:59,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:59,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:16:59,857 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:16:59,857 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:59,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1008064552, now seen corresponding path program 1 times [2025-01-10 01:16:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:16:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058367551] [2025-01-10 01:16:59,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:59,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:16:59,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:59,860 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:59,861 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:59,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:16:59,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:16:59,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:59,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:59,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:16:59,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:16:59,965 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:59,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:16:59,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:16:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058367551] [2025-01-10 01:16:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058367551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058659772] [2025-01-10 01:16:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:59,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:16:59,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:59,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:59,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-01-10 01:16:59,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:59,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:59,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-01-10 01:16:59,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:00,146 INFO L124 PetriNetUnfolderBase]: 95/207 cut-off events. [2025-01-10 01:17:00,147 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:17:00,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 207 events. 95/207 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 756 event pairs, 35 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 399. Up to 83 conditions per place. [2025-01-10 01:17:00,148 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 27 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2025-01-10 01:17:00,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 169 flow [2025-01-10 01:17:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:17:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:17:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2025-01-10 01:17:00,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-01-10 01:17:00,154 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 57 flow. Second operand 6 states and 78 transitions. [2025-01-10 01:17:00,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 169 flow [2025-01-10 01:17:00,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:17:00,155 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 92 flow [2025-01-10 01:17:00,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2025-01-10 01:17:00,156 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2025-01-10 01:17:00,156 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 92 flow [2025-01-10 01:17:00,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:00,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:00,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:17:00,360 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:00,360 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:00,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1186215886, now seen corresponding path program 1 times [2025-01-10 01:17:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303754853] [2025-01-10 01:17:00,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:00,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:00,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:00,363 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:00,364 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:00,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:17:00,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:17:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:00,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:17:00,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:17:00,572 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:00,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:17:00,655 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:00,655 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:17:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303754853] [2025-01-10 01:17:00,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303754853] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:17:00,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:17:00,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2025-01-10 01:17:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933644569] [2025-01-10 01:17:00,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 01:17:00,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:17:00,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:17:00,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:17:00,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:17:00,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-01-10 01:17:00,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 92 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:00,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-01-10 01:17:00,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:01,115 INFO L124 PetriNetUnfolderBase]: 153/301 cut-off events. [2025-01-10 01:17:01,116 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-10 01:17:01,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 301 events. 153/301 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1107 event pairs, 9 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 782. Up to 68 conditions per place. [2025-01-10 01:17:01,120 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 23 selfloop transitions, 11 changer transitions 42/78 dead transitions. [2025-01-10 01:17:01,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 394 flow [2025-01-10 01:17:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:17:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 01:17:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 167 transitions. [2025-01-10 01:17:01,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3638344226579521 [2025-01-10 01:17:01,125 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 92 flow. Second operand 17 states and 167 transitions. [2025-01-10 01:17:01,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 394 flow [2025-01-10 01:17:01,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 381 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:17:01,128 INFO L231 Difference]: Finished difference. Result has 58 places, 25 transitions, 145 flow [2025-01-10 01:17:01,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=25} [2025-01-10 01:17:01,129 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2025-01-10 01:17:01,130 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 25 transitions, 145 flow [2025-01-10 01:17:01,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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:01,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:01,130 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:01,138 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:01,330 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:01,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:01,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -102586971, now seen corresponding path program 1 times [2025-01-10 01:17:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:17:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106642471] [2025-01-10 01:17:01,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:01,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:17:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:17:01,334 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:01,335 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:01,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:17:01,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:17:01,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:01,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:17:01,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:17:01,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:17:01,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:17:01,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:01,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:17:01,437 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 01:17:01,437 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:17:01,438 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-01-10 01:17:01,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 01:17:01,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-10 01:17:01,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-10 01:17:01,441 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-01-10 01:17:01,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:17:01,647 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:01,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 01:17:01,673 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:17:01,673 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:17:01,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:17:01 BasicIcfg [2025-01-10 01:17:01,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:17:01,678 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:17:01,678 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:17:01,679 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:17:01,679 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:58" (3/4) ... [2025-01-10 01:17:01,681 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 01:17:01,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:17:01,683 INFO L158 Benchmark]: Toolchain (without parser) took 4080.99ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 56.7MB in the end (delta: 34.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2025-01-10 01:17:01,683 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:17:01,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.46ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 70.8MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:17:01,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.31ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 69.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:17:01,684 INFO L158 Benchmark]: Boogie Preprocessor took 61.98ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 67.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:17:01,684 INFO L158 Benchmark]: RCFGBuilder took 476.45ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 43.8MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:17:01,685 INFO L158 Benchmark]: TraceAbstraction took 3036.33ms. Allocated memory is still 117.4MB. Free memory was 43.1MB in the beginning and 56.7MB in the end (delta: -13.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:17:01,685 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 117.4MB. Free memory was 56.7MB in the beginning and 56.7MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:17:01,686 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.48ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.46ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 70.8MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.31ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 69.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.98ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 67.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 476.45ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 43.8MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3036.33ms. Allocated memory is still 117.4MB. Free memory was 43.1MB in the beginning and 56.7MB in the end (delta: -13.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 117.4MB. Free memory was 56.7MB in the beginning and 56.7MB in the end (delta: 8.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; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 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: 2.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 7 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 7 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 0/2 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:01,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample