./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:47:54,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:47:54,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:47:54,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:47:54,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:47:54,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:47:54,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:47:54,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:47:54,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:47:54,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:47:54,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:47:54,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:47:54,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:47:54,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:47:54,094 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:47:54,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:47:54,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:47:54,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:47:54,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:47:54,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:47:54,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:47:54,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:47:54,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:47:54,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:47:54,096 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2025-02-06 12:47:54,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:47:54,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:47:54,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:47:54,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:47:54,328 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:47:54,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 12:47:55,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ede45c26/f1dc83310a32448998c441dc6c2c0804/FLAGb7545f04e [2025-02-06 12:47:56,054 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:47:56,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 12:47:56,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ede45c26/f1dc83310a32448998c441dc6c2c0804/FLAGb7545f04e [2025-02-06 12:47:56,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ede45c26/f1dc83310a32448998c441dc6c2c0804 [2025-02-06 12:47:56,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:47:56,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:47:56,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:47:56,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:47:56,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:47:56,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2217ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56, skipping insertion in model container [2025-02-06 12:47:56,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:47:56,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:47:56,280 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:47:56,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:47:56,343 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:47:56,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56 WrapperNode [2025-02-06 12:47:56,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:47:56,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:47:56,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:47:56,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:47:56,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,387 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2025-02-06 12:47:56,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:47:56,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:47:56,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:47:56,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:47:56,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,407 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:47:56,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:47:56,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:47:56,420 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:47:56,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:47:56,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (1/1) ... [2025-02-06 12:47:56,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:47:56,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:56,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:47:56,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:47:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:47:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:47:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:47:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:47:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:47:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:47:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:47:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:47:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:47:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:47:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:47:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:47:56,492 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:47:56,585 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:47:56,587 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:47:56,789 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:47:56,789 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:47:56,934 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:47:56,935 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:47:56,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:56 BoogieIcfgContainer [2025-02-06 12:47:56,935 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:47:56,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:47:56,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:47:56,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:47:56,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:47:56" (1/3) ... [2025-02-06 12:47:56,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa823bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:47:56, skipping insertion in model container [2025-02-06 12:47:56,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:56" (2/3) ... [2025-02-06 12:47:56,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa823bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:47:56, skipping insertion in model container [2025-02-06 12:47:56,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:56" (3/3) ... [2025-02-06 12:47:56,941 INFO L128 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 12:47:56,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:47:56,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:47:56,952 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:47:56,987 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:47:57,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-02-06 12:47:57,028 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-02-06 12:47:57,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:57,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-02-06 12:47:57,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-02-06 12:47:57,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-02-06 12:47:57,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:47:57,046 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;@7f49f321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:47:57,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:47:57,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:47:57,049 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:47:57,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:57,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:57,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:47:57,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:57,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash 11768651, now seen corresponding path program 1 times [2025-02-06 12:47:57,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:57,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-02-06 12:47:57,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:57,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:47:57,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:47:57,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:57,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:57,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:57,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-02-06 12:47:57,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569548551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:57,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:57,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:57,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117135142] [2025-02-06 12:47:57,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:57,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:57,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:57,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:57,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:57,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:57,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:57,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:57,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:58,152 INFO L124 PetriNetUnfolderBase]: 5315/7708 cut-off events. [2025-02-06 12:47:58,152 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-06 12:47:58,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15359 conditions, 7708 events. 5315/7708 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 43978 event pairs, 575 based on Foata normal form. 432/8139 useless extension candidates. Maximal degree in co-relation 15348. Up to 6611 conditions per place. [2025-02-06 12:47:58,210 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-02-06 12:47:58,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 241 flow [2025-02-06 12:47:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-06 12:47:58,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 12:47:58,222 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 88 transitions. [2025-02-06 12:47:58,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 241 flow [2025-02-06 12:47:58,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:47:58,230 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-02-06 12:47:58,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-06 12:47:58,236 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-02-06 12:47:58,237 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-02-06 12:47:58,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:58,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:58,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:58,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:47:58,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:58,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 824008877, now seen corresponding path program 1 times [2025-02-06 12:47:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943028252] [2025-02-06 12:47:58,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:58,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:47:58,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:47:58,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:58,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943028252] [2025-02-06 12:47:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943028252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:58,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:58,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550425398] [2025-02-06 12:47:58,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:58,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:58,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:58,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:58,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:58,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:58,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:58,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:58,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:59,012 INFO L124 PetriNetUnfolderBase]: 4775/7463 cut-off events. [2025-02-06 12:47:59,012 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-02-06 12:47:59,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14695 conditions, 7463 events. 4775/7463 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44288 event pairs, 4775 based on Foata normal form. 216/7672 useless extension candidates. Maximal degree in co-relation 14685. Up to 6804 conditions per place. [2025-02-06 12:47:59,043 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:47:59,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2025-02-06 12:47:59,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 12:47:59,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-06 12:47:59,046 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2025-02-06 12:47:59,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2025-02-06 12:47:59,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:59,049 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-02-06 12:47:59,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-02-06 12:47:59,050 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-02-06 12:47:59,050 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-02-06 12:47:59,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:59,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:59,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:59,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:47:59,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:59,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash 824009317, now seen corresponding path program 1 times [2025-02-06 12:47:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:59,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724421337] [2025-02-06 12:47:59,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:59,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:47:59,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:47:59,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:59,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724421337] [2025-02-06 12:47:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724421337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:59,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864237804] [2025-02-06 12:47:59,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:59,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:59,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:59,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:59,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:59,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:59,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:59,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:59,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:59,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:00,682 INFO L124 PetriNetUnfolderBase]: 5831/8735 cut-off events. [2025-02-06 12:48:00,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:00,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17189 conditions, 8735 events. 5831/8735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 49231 event pairs, 827 based on Foata normal form. 0/8548 useless extension candidates. Maximal degree in co-relation 17183. Up to 4993 conditions per place. [2025-02-06 12:48:00,722 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 2 changer transitions 70/117 dead transitions. [2025-02-06 12:48:00,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 117 transitions, 466 flow [2025-02-06 12:48:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:48:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:48:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-02-06 12:48:00,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2025-02-06 12:48:00,724 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 186 transitions. [2025-02-06 12:48:00,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 117 transitions, 466 flow [2025-02-06 12:48:00,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 117 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:00,728 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 89 flow [2025-02-06 12:48:00,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2025-02-06 12:48:00,729 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-02-06 12:48:00,729 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 89 flow [2025-02-06 12:48:00,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:00,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:00,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:00,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:48:00,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:00,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:00,730 INFO L85 PathProgramCache]: Analyzing trace with hash -896146524, now seen corresponding path program 1 times [2025-02-06 12:48:00,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:00,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244581161] [2025-02-06 12:48:00,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:00,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:00,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:48:00,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:48:00,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:00,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:01,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244581161] [2025-02-06 12:48:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244581161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:01,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444872044] [2025-02-06 12:48:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:01,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:01,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:01,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:01,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:48:01,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:01,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:01,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:48:01,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:02,122 INFO L124 PetriNetUnfolderBase]: 5299/7727 cut-off events. [2025-02-06 12:48:02,122 INFO L125 PetriNetUnfolderBase]: For 2112/2112 co-relation queries the response was YES. [2025-02-06 12:48:02,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17151 conditions, 7727 events. 5299/7727 cut-off events. For 2112/2112 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 43011 event pairs, 593 based on Foata normal form. 214/7941 useless extension candidates. Maximal degree in co-relation 17139. Up to 4063 conditions per place. [2025-02-06 12:48:02,151 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 63 selfloop transitions, 14 changer transitions 86/168 dead transitions. [2025-02-06 12:48:02,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 168 transitions, 727 flow [2025-02-06 12:48:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:48:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 12:48:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 284 transitions. [2025-02-06 12:48:02,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4965034965034965 [2025-02-06 12:48:02,153 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 89 flow. Second operand 13 states and 284 transitions. [2025-02-06 12:48:02,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 168 transitions, 727 flow [2025-02-06 12:48:02,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 168 transitions, 687 flow, removed 16 selfloop flow, removed 6 redundant places. [2025-02-06 12:48:02,193 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 225 flow [2025-02-06 12:48:02,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=225, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-02-06 12:48:02,194 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2025-02-06 12:48:02,194 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 225 flow [2025-02-06 12:48:02,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:02,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:02,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:02,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:48:02,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash -913168412, now seen corresponding path program 2 times [2025-02-06 12:48:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715165411] [2025-02-06 12:48:02,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:48:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:02,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:48:02,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:48:02,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:48:02,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:02,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:02,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715165411] [2025-02-06 12:48:02,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715165411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:02,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:02,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:02,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468458769] [2025-02-06 12:48:02,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:02,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:02,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:02,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:02,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:02,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:48:02,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:02,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:02,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:48:02,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:03,260 INFO L124 PetriNetUnfolderBase]: 4898/7352 cut-off events. [2025-02-06 12:48:03,261 INFO L125 PetriNetUnfolderBase]: For 22468/22468 co-relation queries the response was YES. [2025-02-06 12:48:03,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26868 conditions, 7352 events. 4898/7352 cut-off events. For 22468/22468 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 39924 event pairs, 1347 based on Foata normal form. 180/7530 useless extension candidates. Maximal degree in co-relation 26849. Up to 5324 conditions per place. [2025-02-06 12:48:03,294 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 58 selfloop transitions, 3 changer transitions 49/115 dead transitions. [2025-02-06 12:48:03,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 115 transitions, 847 flow [2025-02-06 12:48:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:48:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:48:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2025-02-06 12:48:03,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.512987012987013 [2025-02-06 12:48:03,296 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 225 flow. Second operand 7 states and 158 transitions. [2025-02-06 12:48:03,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 115 transitions, 847 flow [2025-02-06 12:48:03,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 822 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 12:48:03,330 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 229 flow [2025-02-06 12:48:03,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-02-06 12:48:03,331 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-02-06 12:48:03,331 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 229 flow [2025-02-06 12:48:03,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:03,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:03,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:03,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:48:03,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:03,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash -962484091, now seen corresponding path program 1 times [2025-02-06 12:48:03,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:03,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504588694] [2025-02-06 12:48:03,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:03,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:03,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:48:03,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:48:03,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:03,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:03,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:03,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504588694] [2025-02-06 12:48:03,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504588694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:03,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:03,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:48:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264326297] [2025-02-06 12:48:03,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:03,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:48:03,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:03,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:48:03,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:48:03,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:48:03,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:03,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:03,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:48:03,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:04,470 INFO L124 PetriNetUnfolderBase]: 5963/8811 cut-off events. [2025-02-06 12:48:04,470 INFO L125 PetriNetUnfolderBase]: For 28422/28431 co-relation queries the response was YES. [2025-02-06 12:48:04,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31908 conditions, 8811 events. 5963/8811 cut-off events. For 28422/28431 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 48617 event pairs, 975 based on Foata normal form. 158/8966 useless extension candidates. Maximal degree in co-relation 31887. Up to 3249 conditions per place. [2025-02-06 12:48:04,509 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 3 changer transitions 66/125 dead transitions. [2025-02-06 12:48:04,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 125 transitions, 912 flow [2025-02-06 12:48:04,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:48:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:48:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-02-06 12:48:04,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5170454545454546 [2025-02-06 12:48:04,511 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 229 flow. Second operand 8 states and 182 transitions. [2025-02-06 12:48:04,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 125 transitions, 912 flow [2025-02-06 12:48:04,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 125 transitions, 890 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 12:48:04,545 INFO L231 Difference]: Finished difference. Result has 66 places, 36 transitions, 192 flow [2025-02-06 12:48:04,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=66, PETRI_TRANSITIONS=36} [2025-02-06 12:48:04,546 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-02-06 12:48:04,546 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 36 transitions, 192 flow [2025-02-06 12:48:04,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:04,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:04,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:04,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:48:04,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:04,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1505463174, now seen corresponding path program 1 times [2025-02-06 12:48:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:04,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503260483] [2025-02-06 12:48:04,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:04,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:48:04,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:48:04,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:04,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503260483] [2025-02-06 12:48:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503260483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:04,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:04,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307358843] [2025-02-06 12:48:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:04,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:04,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:04,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:04,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:48:04,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 36 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:04,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:04,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:48:04,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:05,441 INFO L124 PetriNetUnfolderBase]: 4066/6118 cut-off events. [2025-02-06 12:48:05,442 INFO L125 PetriNetUnfolderBase]: For 21368/21371 co-relation queries the response was YES. [2025-02-06 12:48:05,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22662 conditions, 6118 events. 4066/6118 cut-off events. For 21368/21371 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 32617 event pairs, 1048 based on Foata normal form. 121/6239 useless extension candidates. Maximal degree in co-relation 22639. Up to 2478 conditions per place. [2025-02-06 12:48:05,466 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 3 changer transitions 62/114 dead transitions. [2025-02-06 12:48:05,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 819 flow [2025-02-06 12:48:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:48:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:48:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2025-02-06 12:48:05,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-02-06 12:48:05,467 INFO L175 Difference]: Start difference. First operand has 66 places, 36 transitions, 192 flow. Second operand 8 states and 180 transitions. [2025-02-06 12:48:05,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 819 flow [2025-02-06 12:48:05,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 745 flow, removed 20 selfloop flow, removed 11 redundant places. [2025-02-06 12:48:05,488 INFO L231 Difference]: Finished difference. Result has 63 places, 35 transitions, 175 flow [2025-02-06 12:48:05,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=63, PETRI_TRANSITIONS=35} [2025-02-06 12:48:05,490 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-02-06 12:48:05,491 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 35 transitions, 175 flow [2025-02-06 12:48:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:05,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:05,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:05,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:48:05,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash 925989217, now seen corresponding path program 1 times [2025-02-06 12:48:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476746792] [2025-02-06 12:48:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:05,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:48:05,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:48:05,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:05,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:05,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476746792] [2025-02-06 12:48:05,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476746792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:05,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:05,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:48:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485248963] [2025-02-06 12:48:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:05,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:05,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:05,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:05,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:05,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 35 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:05,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:05,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:05,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:05,999 INFO L124 PetriNetUnfolderBase]: 1611/2593 cut-off events. [2025-02-06 12:48:05,999 INFO L125 PetriNetUnfolderBase]: For 7053/7054 co-relation queries the response was YES. [2025-02-06 12:48:06,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8763 conditions, 2593 events. 1611/2593 cut-off events. For 7053/7054 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12602 event pairs, 205 based on Foata normal form. 106/2699 useless extension candidates. Maximal degree in co-relation 8742. Up to 1447 conditions per place. [2025-02-06 12:48:06,011 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2025-02-06 12:48:06,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 417 flow [2025-02-06 12:48:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:48:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:48:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-06 12:48:06,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-06 12:48:06,013 INFO L175 Difference]: Start difference. First operand has 63 places, 35 transitions, 175 flow. Second operand 4 states and 99 transitions. [2025-02-06 12:48:06,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 417 flow [2025-02-06 12:48:06,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 391 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-02-06 12:48:06,019 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 169 flow [2025-02-06 12:48:06,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-02-06 12:48:06,019 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-02-06 12:48:06,019 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 169 flow [2025-02-06 12:48:06,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:06,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:06,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:06,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:48:06,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:06,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:06,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1292163228, now seen corresponding path program 1 times [2025-02-06 12:48:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:06,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383868377] [2025-02-06 12:48:06,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:06,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:06,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:48:06,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:48:06,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:06,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:06,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:06,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383868377] [2025-02-06 12:48:06,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383868377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:06,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:06,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:48:06,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197163923] [2025-02-06 12:48:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:06,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:48:06,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:06,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:48:06,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:48:06,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:06,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:06,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:06,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:06,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:06,438 INFO L124 PetriNetUnfolderBase]: 1039/1707 cut-off events. [2025-02-06 12:48:06,438 INFO L125 PetriNetUnfolderBase]: For 4278/4279 co-relation queries the response was YES. [2025-02-06 12:48:06,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5795 conditions, 1707 events. 1039/1707 cut-off events. For 4278/4279 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7520 event pairs, 115 based on Foata normal form. 84/1791 useless extension candidates. Maximal degree in co-relation 5779. Up to 661 conditions per place. [2025-02-06 12:48:06,443 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 60 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2025-02-06 12:48:06,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 508 flow [2025-02-06 12:48:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:48:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:48:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-02-06 12:48:06,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 12:48:06,445 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 169 flow. Second operand 5 states and 121 transitions. [2025-02-06 12:48:06,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 508 flow [2025-02-06 12:48:06,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 498 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:06,447 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 209 flow [2025-02-06 12:48:06,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2025-02-06 12:48:06,448 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2025-02-06 12:48:06,448 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 209 flow [2025-02-06 12:48:06,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:06,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:06,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:06,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:48:06,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash 788256735, now seen corresponding path program 1 times [2025-02-06 12:48:06,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:06,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-02-06 12:48:06,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:06,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:48:06,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:48:06,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:06,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-02-06 12:48:06,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295655933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:06,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:06,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609944686] [2025-02-06 12:48:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:06,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:06,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:06,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:06,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:06,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:06,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:06,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:06,794 INFO L124 PetriNetUnfolderBase]: 605/993 cut-off events. [2025-02-06 12:48:06,795 INFO L125 PetriNetUnfolderBase]: For 3280/3281 co-relation queries the response was YES. [2025-02-06 12:48:06,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 993 events. 605/993 cut-off events. For 3280/3281 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3702 event pairs, 97 based on Foata normal form. 40/1033 useless extension candidates. Maximal degree in co-relation 3593. Up to 308 conditions per place. [2025-02-06 12:48:06,798 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 53 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2025-02-06 12:48:06,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 483 flow [2025-02-06 12:48:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:48:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:48:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-02-06 12:48:06,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4810606060606061 [2025-02-06 12:48:06,799 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 209 flow. Second operand 6 states and 127 transitions. [2025-02-06 12:48:06,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 483 flow [2025-02-06 12:48:06,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 436 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-02-06 12:48:06,802 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 203 flow [2025-02-06 12:48:06,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2025-02-06 12:48:06,803 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2025-02-06 12:48:06,803 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 203 flow [2025-02-06 12:48:06,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:06,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:06,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:48:06,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash -595602639, now seen corresponding path program 1 times [2025-02-06 12:48:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:06,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721376303] [2025-02-06 12:48:06,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:06,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:06,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:06,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:06,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:08,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:48:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721376303] [2025-02-06 12:48:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721376303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:08,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:48:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107781269] [2025-02-06 12:48:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:48:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:48:08,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:48:08,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:48:08,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:48:08,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 203 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:08,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:08,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:48:08,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:08,569 INFO L124 PetriNetUnfolderBase]: 757/1237 cut-off events. [2025-02-06 12:48:08,569 INFO L125 PetriNetUnfolderBase]: For 3472/3472 co-relation queries the response was YES. [2025-02-06 12:48:08,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4431 conditions, 1237 events. 757/1237 cut-off events. For 3472/3472 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4987 event pairs, 154 based on Foata normal form. 8/1245 useless extension candidates. Maximal degree in co-relation 4413. Up to 684 conditions per place. [2025-02-06 12:48:08,574 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 45 selfloop transitions, 3 changer transitions 34/87 dead transitions. [2025-02-06 12:48:08,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 612 flow [2025-02-06 12:48:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:48:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:48:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2025-02-06 12:48:08,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2025-02-06 12:48:08,575 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 203 flow. Second operand 8 states and 141 transitions. [2025-02-06 12:48:08,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 612 flow [2025-02-06 12:48:08,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 435 flow, removed 46 selfloop flow, removed 12 redundant places. [2025-02-06 12:48:08,580 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 138 flow [2025-02-06 12:48:08,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-02-06 12:48:08,580 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2025-02-06 12:48:08,580 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 138 flow [2025-02-06 12:48:08,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:08,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:08,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:08,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:48:08,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:08,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:08,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1711746577, now seen corresponding path program 2 times [2025-02-06 12:48:08,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:48:08,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669278584] [2025-02-06 12:48:08,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:48:08,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:48:08,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:08,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:08,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:48:08,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:48:08,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:48:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:08,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:08,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:08,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:48:08,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:48:08,703 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:48:08,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:48:08,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:48:08,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:48:08,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:48:08,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:48:08,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:48:08,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:48:08,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:48:08,707 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:08,784 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:48:08,784 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:48:08,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:48:08 BasicIcfg [2025-02-06 12:48:08,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:48:08,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:48:08,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:48:08,789 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:48:08,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:56" (3/4) ... [2025-02-06 12:48:08,791 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:48:08,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:48:08,793 INFO L158 Benchmark]: Toolchain (without parser) took 12717.29ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 153.4MB in the beginning and 694.6MB in the end (delta: -541.3MB). Peak memory consumption was 397.7MB. Max. memory is 16.1GB. [2025-02-06 12:48:08,793 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:08,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.41ms. Allocated memory is still 201.3MB. Free memory was 153.1MB in the beginning and 130.1MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:48:08,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.86ms. Allocated memory is still 201.3MB. Free memory was 130.1MB in the beginning and 127.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:08,794 INFO L158 Benchmark]: Boogie Preprocessor took 31.13ms. Allocated memory is still 201.3MB. Free memory was 127.6MB in the beginning and 124.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:08,794 INFO L158 Benchmark]: IcfgBuilder took 515.32ms. Allocated memory is still 201.3MB. Free memory was 124.5MB in the beginning and 70.0MB in the end (delta: 54.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 12:48:08,795 INFO L158 Benchmark]: TraceAbstraction took 11851.92ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 69.5MB in the beginning and 694.9MB in the end (delta: -625.4MB). Peak memory consumption was 313.9MB. Max. memory is 16.1GB. [2025-02-06 12:48:08,795 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 1.1GB. Free memory was 694.9MB in the beginning and 694.6MB in the end (delta: 240.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:08,796 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.41ms. Allocated memory is still 201.3MB. Free memory was 153.1MB in the beginning and 130.1MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.86ms. Allocated memory is still 201.3MB. Free memory was 130.1MB in the beginning and 127.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.13ms. Allocated memory is still 201.3MB. Free memory was 127.6MB in the beginning and 124.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 515.32ms. Allocated memory is still 201.3MB. Free memory was 124.5MB in the beginning and 70.0MB in the end (delta: 54.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11851.92ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 69.5MB in the beginning and 694.9MB in the end (delta: -625.4MB). Peak memory consumption was 313.9MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 1.1GB. Free memory was 694.9MB in the beginning and 694.6MB in the end (delta: 240.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-2, t1962=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-2, t1962=-1, t1963=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-2, t1962=-1, t1963=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-2, t1962=-1, t1963=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-2, t1962=-1, t1963=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 821]: 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: 823]: 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 7 procedures, 68 locations, 7 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: 11.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 804 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 802 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1826 IncrementalHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 0 mSDtfsCounter, 1826 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=5, InterpolantAutomatonStates: 73, 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.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:48:08,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:48:10,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:48:10,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:48:10,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:48:10,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:48:10,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:48:10,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:48:10,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:48:10,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:48:10,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:48:10,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:48:10,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:48:10,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:48:10,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:48:10,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:48:10,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:48:10,962 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:48:10,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:48:10,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:48:10,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:48:10,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:48:10,968 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2025-02-06 12:48:11,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:48:11,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:48:11,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:48:11,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:48:11,250 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:48:11,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 12:48:12,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef65021f/3cb4e3dfc3ba48b1abe91c114444e9bd/FLAG13e75ed6c [2025-02-06 12:48:12,859 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:48:12,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 12:48:12,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef65021f/3cb4e3dfc3ba48b1abe91c114444e9bd/FLAG13e75ed6c [2025-02-06 12:48:13,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef65021f/3cb4e3dfc3ba48b1abe91c114444e9bd [2025-02-06 12:48:13,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:48:13,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:48:13,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:48:13,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:48:13,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:48:13,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b39bf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13, skipping insertion in model container [2025-02-06 12:48:13,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:48:13,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:48:13,448 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:48:13,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:48:13,555 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:48:13,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13 WrapperNode [2025-02-06 12:48:13,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:48:13,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:48:13,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:48:13,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:48:13,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,606 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2025-02-06 12:48:13,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:48:13,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:48:13,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:48:13,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:48:13,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,638 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:48:13,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:48:13,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:48:13,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:48:13,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:48:13,662 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (1/1) ... [2025-02-06 12:48:13,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:48:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:13,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:48:13,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:48:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:48:13,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:48:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:48:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:48:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:48:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:48:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:48:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:48:13,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:48:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:48:13,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:48:13,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:48:13,718 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:48:13,845 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:48:13,846 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:48:14,100 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:48:14,100 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:48:14,252 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:48:14,253 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:48:14,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:48:14 BoogieIcfgContainer [2025-02-06 12:48:14,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:48:14,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:48:14,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:48:14,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:48:14,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:48:13" (1/3) ... [2025-02-06 12:48:14,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5270b6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:48:14, skipping insertion in model container [2025-02-06 12:48:14,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:48:13" (2/3) ... [2025-02-06 12:48:14,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5270b6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:48:14, skipping insertion in model container [2025-02-06 12:48:14,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:48:14" (3/3) ... [2025-02-06 12:48:14,258 INFO L128 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 12:48:14,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:48:14,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:48:14,268 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:48:14,308 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:48:14,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-02-06 12:48:14,394 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-02-06 12:48:14,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:14,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-02-06 12:48:14,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-02-06 12:48:14,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-02-06 12:48:14,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:48:14,413 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;@1b343920, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:48:14,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:48:14,415 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:48:14,416 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:48:14,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:14,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:14,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:48:14,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash 11830219, now seen corresponding path program 1 times [2025-02-06 12:48:14,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:14,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644972443] [2025-02-06 12:48:14,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:14,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:14,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:14,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:14,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:48:14,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:48:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:48:14,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:14,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:14,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:48:14,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:14,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:14,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:14,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644972443] [2025-02-06 12:48:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644972443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:14,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:14,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514564330] [2025-02-06 12:48:14,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:14,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:14,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:14,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:14,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:14,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:14,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:14,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:14,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:15,441 INFO L124 PetriNetUnfolderBase]: 5315/7708 cut-off events. [2025-02-06 12:48:15,442 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-06 12:48:15,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15359 conditions, 7708 events. 5315/7708 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 43978 event pairs, 575 based on Foata normal form. 432/8139 useless extension candidates. Maximal degree in co-relation 15348. Up to 6611 conditions per place. [2025-02-06 12:48:15,477 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-02-06 12:48:15,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 241 flow [2025-02-06 12:48:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-06 12:48:15,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 12:48:15,486 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 88 transitions. [2025-02-06 12:48:15,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 241 flow [2025-02-06 12:48:15,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:15,491 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-02-06 12:48:15,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-06 12:48:15,494 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-02-06 12:48:15,494 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-02-06 12:48:15,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:15,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:15,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:15,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:15,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:15,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:15,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash 217310959, now seen corresponding path program 1 times [2025-02-06 12:48:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254144809] [2025-02-06 12:48:15,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:15,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:15,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:15,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:15,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:48:15,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:48:15,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:48:15,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:15,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:15,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:48:15,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:15,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:15,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:15,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254144809] [2025-02-06 12:48:15,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254144809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:15,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:15,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:48:15,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193370739] [2025-02-06 12:48:15,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:15,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:48:15,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:15,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:48:15,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:48:15,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:48:15,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:15,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:15,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:48:15,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:16,368 INFO L124 PetriNetUnfolderBase]: 4775/7463 cut-off events. [2025-02-06 12:48:16,368 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-02-06 12:48:16,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14695 conditions, 7463 events. 4775/7463 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44288 event pairs, 4775 based on Foata normal form. 216/7672 useless extension candidates. Maximal degree in co-relation 14685. Up to 6804 conditions per place. [2025-02-06 12:48:16,406 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:48:16,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2025-02-06 12:48:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:48:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:48:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 12:48:16,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-06 12:48:16,408 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2025-02-06 12:48:16,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2025-02-06 12:48:16,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:16,409 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-02-06 12:48:16,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-02-06 12:48:16,409 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-02-06 12:48:16,410 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-02-06 12:48:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:16,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:16,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:16,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:48:16,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:16,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash 217311399, now seen corresponding path program 1 times [2025-02-06 12:48:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011908928] [2025-02-06 12:48:16,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:16,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:16,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:16,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:48:16,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:48:16,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:48:16,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:16,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:48:16,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:16,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:16,714 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:16,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011908928] [2025-02-06 12:48:16,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011908928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:16,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:16,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:48:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548126745] [2025-02-06 12:48:16,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:16,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:48:16,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:16,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:48:16,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:48:16,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:16,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:16,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:16,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:16,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:17,189 INFO L124 PetriNetUnfolderBase]: 3471/5583 cut-off events. [2025-02-06 12:48:17,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:48:17,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10789 conditions, 5583 events. 3471/5583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 33244 event pairs, 535 based on Foata normal form. 216/5794 useless extension candidates. Maximal degree in co-relation 10783. Up to 3001 conditions per place. [2025-02-06 12:48:17,214 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 55 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2025-02-06 12:48:17,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 268 flow [2025-02-06 12:48:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:48:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:48:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-06 12:48:17,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2025-02-06 12:48:17,215 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 103 transitions. [2025-02-06 12:48:17,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 268 flow [2025-02-06 12:48:17,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:48:17,217 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2025-02-06 12:48:17,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-02-06 12:48:17,217 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-02-06 12:48:17,217 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2025-02-06 12:48:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:17,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:17,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:17,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:17,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:17,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1077882801, now seen corresponding path program 1 times [2025-02-06 12:48:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132033332] [2025-02-06 12:48:17,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:17,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:17,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:48:17,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:48:17,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:48:17,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:17,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:17,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:48:17,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:17,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:17,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132033332] [2025-02-06 12:48:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132033332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:17,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:17,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:48:17,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447449589] [2025-02-06 12:48:17,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:17,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:48:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:17,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:48:17,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:48:17,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:17,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:17,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:17,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:17,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:17,777 INFO L124 PetriNetUnfolderBase]: 1935/3119 cut-off events. [2025-02-06 12:48:17,778 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2025-02-06 12:48:17,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7056 conditions, 3119 events. 1935/3119 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 15982 event pairs, 339 based on Foata normal form. 152/3266 useless extension candidates. Maximal degree in co-relation 7047. Up to 985 conditions per place. [2025-02-06 12:48:17,787 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 70 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-02-06 12:48:17,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 384 flow [2025-02-06 12:48:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:48:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:48:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-06 12:48:17,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2025-02-06 12:48:17,789 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 131 transitions. [2025-02-06 12:48:17,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 384 flow [2025-02-06 12:48:17,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:48:17,791 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2025-02-06 12:48:17,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-02-06 12:48:17,792 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-02-06 12:48:17,792 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2025-02-06 12:48:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:17,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:17,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:17,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:17,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:17,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:17,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash -915144182, now seen corresponding path program 1 times [2025-02-06 12:48:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376152345] [2025-02-06 12:48:17,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:17,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:17,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:17,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:48:18,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:48:18,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:48:18,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:18,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:18,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:48:18,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:18,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:18,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:18,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376152345] [2025-02-06 12:48:18,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376152345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:18,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:18,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:48:18,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323984947] [2025-02-06 12:48:18,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:18,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:48:18,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:18,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:48:18,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:48:18,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:18,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:18,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:18,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:18,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:18,348 INFO L124 PetriNetUnfolderBase]: 1167/1823 cut-off events. [2025-02-06 12:48:18,348 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2025-02-06 12:48:18,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4568 conditions, 1823 events. 1167/1823 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8061 event pairs, 303 based on Foata normal form. 56/1874 useless extension candidates. Maximal degree in co-relation 4557. Up to 672 conditions per place. [2025-02-06 12:48:18,353 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 59 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2025-02-06 12:48:18,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 375 flow [2025-02-06 12:48:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:48:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:48:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-02-06 12:48:18,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2025-02-06 12:48:18,355 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 133 transitions. [2025-02-06 12:48:18,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 375 flow [2025-02-06 12:48:18,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 350 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:48:18,361 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2025-02-06 12:48:18,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-02-06 12:48:18,361 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-02-06 12:48:18,362 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2025-02-06 12:48:18,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:18,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:18,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:18,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:48:18,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:18,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:18,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1477626093, now seen corresponding path program 1 times [2025-02-06 12:48:18,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:18,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278442189] [2025-02-06 12:48:18,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:48:18,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:18,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:18,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:18,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:48:18,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:18,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:18,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:18,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:18,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:48:18,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:18,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:18,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278442189] [2025-02-06 12:48:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278442189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:18,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:18,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:48:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029898997] [2025-02-06 12:48:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:18,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:48:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:18,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:48:18,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:48:18,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:18,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:18,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:18,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:18,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:19,069 INFO L124 PetriNetUnfolderBase]: 1713/2677 cut-off events. [2025-02-06 12:48:19,070 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2025-02-06 12:48:19,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6843 conditions, 2677 events. 1713/2677 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13013 event pairs, 275 based on Foata normal form. 8/2683 useless extension candidates. Maximal degree in co-relation 6831. Up to 1091 conditions per place. [2025-02-06 12:48:19,078 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 63 selfloop transitions, 7 changer transitions 25/101 dead transitions. [2025-02-06 12:48:19,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 569 flow [2025-02-06 12:48:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:48:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:48:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-02-06 12:48:19,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097402597402597 [2025-02-06 12:48:19,080 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 7 states and 157 transitions. [2025-02-06 12:48:19,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 569 flow [2025-02-06 12:48:19,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 452 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:48:19,087 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 164 flow [2025-02-06 12:48:19,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-02-06 12:48:19,088 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2025-02-06 12:48:19,088 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 164 flow [2025-02-06 12:48:19,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:19,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:19,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:19,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:19,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:19,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:19,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash -207807015, now seen corresponding path program 2 times [2025-02-06 12:48:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:19,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730159648] [2025-02-06 12:48:19,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:48:19,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:19,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:19,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:19,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:48:19,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:19,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:19,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:48:19,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:19,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:48:19,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:19,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:19,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:19,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730159648] [2025-02-06 12:48:19,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730159648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:19,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:19,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:48:19,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364013051] [2025-02-06 12:48:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:19,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:48:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:19,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:48:19,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:48:19,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:19,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 164 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:19,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:19,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:19,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:19,909 INFO L124 PetriNetUnfolderBase]: 1247/1991 cut-off events. [2025-02-06 12:48:19,911 INFO L125 PetriNetUnfolderBase]: For 588/589 co-relation queries the response was YES. [2025-02-06 12:48:19,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4764 conditions, 1991 events. 1247/1991 cut-off events. For 588/589 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8802 event pairs, 273 based on Foata normal form. 8/1999 useless extension candidates. Maximal degree in co-relation 4751. Up to 944 conditions per place. [2025-02-06 12:48:19,922 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 53 selfloop transitions, 8 changer transitions 29/96 dead transitions. [2025-02-06 12:48:19,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 494 flow [2025-02-06 12:48:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:48:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:48:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-02-06 12:48:19,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4837662337662338 [2025-02-06 12:48:19,924 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 164 flow. Second operand 7 states and 149 transitions. [2025-02-06 12:48:19,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 494 flow [2025-02-06 12:48:19,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 479 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 12:48:19,928 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 205 flow [2025-02-06 12:48:19,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-02-06 12:48:19,929 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-02-06 12:48:19,929 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 205 flow [2025-02-06 12:48:19,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:19,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:19,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:19,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:20,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:20,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:20,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -601545931, now seen corresponding path program 3 times [2025-02-06 12:48:20,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:20,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633607387] [2025-02-06 12:48:20,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:48:20,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:20,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:20,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:20,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:48:20,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:20,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:20,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:48:20,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:20,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:48:20,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:20,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:20,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633607387] [2025-02-06 12:48:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633607387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:20,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:48:20,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616021043] [2025-02-06 12:48:20,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:20,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:48:20,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:20,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:48:20,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:48:20,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:20,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 205 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:20,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:20,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:20,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:20,792 INFO L124 PetriNetUnfolderBase]: 883/1447 cut-off events. [2025-02-06 12:48:20,792 INFO L125 PetriNetUnfolderBase]: For 755/757 co-relation queries the response was YES. [2025-02-06 12:48:20,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 1447 events. 883/1447 cut-off events. For 755/757 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5957 event pairs, 381 based on Foata normal form. 8/1455 useless extension candidates. Maximal degree in co-relation 3629. Up to 892 conditions per place. [2025-02-06 12:48:20,799 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 52 selfloop transitions, 4 changer transitions 17/79 dead transitions. [2025-02-06 12:48:20,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 458 flow [2025-02-06 12:48:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:48:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:48:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-02-06 12:48:20,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40584415584415584 [2025-02-06 12:48:20,800 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 205 flow. Second operand 7 states and 125 transitions. [2025-02-06 12:48:20,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 458 flow [2025-02-06 12:48:20,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 429 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-02-06 12:48:20,803 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 209 flow [2025-02-06 12:48:20,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2025-02-06 12:48:20,808 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-02-06 12:48:20,808 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 209 flow [2025-02-06 12:48:20,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:20,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:20,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:20,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:21,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:21,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:21,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -521955253, now seen corresponding path program 4 times [2025-02-06 12:48:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:21,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1785302551] [2025-02-06 12:48:21,010 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:48:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:21,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:21,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:48:21,068 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:48:21,081 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 30 statements. [2025-02-06 12:48:21,081 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 12:48:21,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:48:21,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:48:21,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:48:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:48:21,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:48:21,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:48:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785302551] [2025-02-06 12:48:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785302551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:48:21,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:48:21,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:48:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56603277] [2025-02-06 12:48:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:48:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:48:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:48:21,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:48:21,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:48:21,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:48:21,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 209 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:21,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:48:21,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:48:21,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:48:21,997 INFO L124 PetriNetUnfolderBase]: 1420/2341 cut-off events. [2025-02-06 12:48:21,997 INFO L125 PetriNetUnfolderBase]: For 1157/1157 co-relation queries the response was YES. [2025-02-06 12:48:22,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 2341 events. 1420/2341 cut-off events. For 1157/1157 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11163 event pairs, 660 based on Foata normal form. 8/2349 useless extension candidates. Maximal degree in co-relation 6056. Up to 918 conditions per place. [2025-02-06 12:48:22,003 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 65 selfloop transitions, 5 changer transitions 48/124 dead transitions. [2025-02-06 12:48:22,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 733 flow [2025-02-06 12:48:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:48:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:48:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-02-06 12:48:22,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2025-02-06 12:48:22,007 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 209 flow. Second operand 8 states and 167 transitions. [2025-02-06 12:48:22,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 733 flow [2025-02-06 12:48:22,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 124 transitions, 707 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 12:48:22,011 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 214 flow [2025-02-06 12:48:22,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=214, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2025-02-06 12:48:22,011 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2025-02-06 12:48:22,011 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 214 flow [2025-02-06 12:48:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:48:22,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:48:22,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:48:22,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:22,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:22,216 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:48:22,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:48:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 662706935, now seen corresponding path program 5 times [2025-02-06 12:48:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:48:22,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821068108] [2025-02-06 12:48:22,217 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:48:22,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:22,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:48:22,219 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:48:22,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:48:22,268 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:22,283 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:22,283 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:48:22,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:48:22,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:48:22,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:48:22,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:48:22,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:48:22,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:48:22,337 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:48:22,337 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:48:22,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:48:22,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:48:22,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:48:22,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:48:22,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:48:22,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:48:22,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:48:22,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 12:48:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:48:22,541 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-02-06 12:48:22,585 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:48:22,585 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:48:22,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:48:22 BasicIcfg [2025-02-06 12:48:22,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:48:22,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:48:22,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:48:22,589 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:48:22,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:48:14" (3/4) ... [2025-02-06 12:48:22,590 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:48:22,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:48:22,591 INFO L158 Benchmark]: Toolchain (without parser) took 9419.88ms. Allocated memory was 117.4MB in the beginning and 822.1MB in the end (delta: 704.6MB). Free memory was 88.9MB in the beginning and 619.3MB in the end (delta: -530.3MB). Peak memory consumption was 174.7MB. Max. memory is 16.1GB. [2025-02-06 12:48:22,591 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:22,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.76ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 65.4MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:48:22,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.22ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 63.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:22,592 INFO L158 Benchmark]: Boogie Preprocessor took 54.11ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 60.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:48:22,592 INFO L158 Benchmark]: IcfgBuilder took 591.36ms. Allocated memory is still 117.4MB. Free memory was 60.2MB in the beginning and 82.6MB in the end (delta: -22.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2025-02-06 12:48:22,592 INFO L158 Benchmark]: TraceAbstraction took 8333.82ms. Allocated memory was 117.4MB in the beginning and 822.1MB in the end (delta: 704.6MB). Free memory was 81.9MB in the beginning and 619.7MB in the end (delta: -537.8MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2025-02-06 12:48:22,592 INFO L158 Benchmark]: Witness Printer took 2.20ms. Allocated memory is still 822.1MB. Free memory was 619.7MB in the beginning and 619.3MB in the end (delta: 397.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:48:22,593 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.14ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.76ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 65.4MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.22ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 63.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.11ms. Allocated memory is still 117.4MB. Free memory was 63.1MB in the beginning and 60.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 591.36ms. Allocated memory is still 117.4MB. Free memory was 60.2MB in the beginning and 82.6MB in the end (delta: -22.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8333.82ms. Allocated memory was 117.4MB in the beginning and 822.1MB in the end (delta: 704.6MB). Free memory was 81.9MB in the beginning and 619.7MB in the end (delta: -537.8MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. * Witness Printer took 2.20ms. Allocated memory is still 822.1MB. Free memory was 619.7MB in the beginning and 619.3MB in the end (delta: 397.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-2, t1962=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1961=-2, t1962=-1, t1963=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-2, t1962=-1, t1963=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-2, t1962=-1, t1963=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961=-2, t1962=-1, t1963=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 821]: 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: 823]: 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 7 procedures, 68 locations, 7 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: 8.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 556 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1421 IncrementalHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 6 mSDtfsCounter, 1421 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 229 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1092 SizeOfPredicates, 30 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:48:22,612 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