./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:21:24,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:21:24,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:21:24,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:21:24,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:21:24,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:21:24,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:21:24,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:21:24,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:21:24,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:21:24,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:21:24,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:21:24,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:21:24,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:21:24,550 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:21:24,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:21:24,558 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:24,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:21:24,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:21:24,558 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2025-02-08 08:21:24,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:21:24,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:21:24,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:21:24,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:21:24,936 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:21:24,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:26,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8191c395/21bb362c8e734a46a339efbfe023f1e8/FLAGbeaed00f8 [2025-02-08 08:21:26,473 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:21:26,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:26,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8191c395/21bb362c8e734a46a339efbfe023f1e8/FLAGbeaed00f8 [2025-02-08 08:21:26,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8191c395/21bb362c8e734a46a339efbfe023f1e8 [2025-02-08 08:21:26,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:21:26,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:21:26,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:26,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:21:26,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:21:26,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:26" (1/1) ... [2025-02-08 08:21:26,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153f1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:26, skipping insertion in model container [2025-02-08 08:21:26,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:26" (1/1) ... [2025-02-08 08:21:26,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:21:27,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:27,051 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:21:27,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:27,150 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:21:27,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27 WrapperNode [2025-02-08 08:21:27,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:27,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:27,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:21:27,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:21:27,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,195 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2025-02-08 08:21:27,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:27,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:21:27,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:21:27,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:21:27,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,224 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:21:27,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:21:27,244 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:21:27,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:21:27,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:21:27,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (1/1) ... [2025-02-08 08:21:27,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:27,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:21:27,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:21:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:21:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:21:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:21:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:21:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:21:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-08 08:21:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-08 08:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:21:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:21:27,349 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:21:27,557 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:21:27,563 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:21:27,889 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:21:27,889 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:21:28,035 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:21:28,035 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:21:28,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:28 BoogieIcfgContainer [2025-02-08 08:21:28,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:21:28,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:21:28,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:21:28,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:21:28,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:21:26" (1/3) ... [2025-02-08 08:21:28,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb1b597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:28, skipping insertion in model container [2025-02-08 08:21:28,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:27" (2/3) ... [2025-02-08 08:21:28,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb1b597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:28, skipping insertion in model container [2025-02-08 08:21:28,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:28" (3/3) ... [2025-02-08 08:21:28,042 INFO L128 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:28,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:21:28,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:21:28,055 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:21:28,107 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:21:28,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2025-02-08 08:21:28,168 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-02-08 08:21:28,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:28,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-02-08 08:21:28,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2025-02-08 08:21:28,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2025-02-08 08:21:28,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:21:28,208 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;@6967af1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:21:28,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:21:28,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:21:28,221 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 08:21:28,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:28,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:28,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:28,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1365083507, now seen corresponding path program 1 times [2025-02-08 08:21:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565983578] [2025-02-08 08:21:28,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:28,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:21:28,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:21:28,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:28,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:28,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:28,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565983578] [2025-02-08 08:21:28,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565983578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:28,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:28,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450952893] [2025-02-08 08:21:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:28,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:28,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:28,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:28,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:28,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:28,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:28,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:28,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:32,394 INFO L124 PetriNetUnfolderBase]: 43115/57503 cut-off events. [2025-02-08 08:21:32,394 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-02-08 08:21:32,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114619 conditions, 57503 events. 43115/57503 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 1721. Compared 337857 event pairs, 6395 based on Foata normal form. 2592/60034 useless extension candidates. Maximal degree in co-relation 114607. Up to 47521 conditions per place. [2025-02-08 08:21:32,692 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 57 selfloop transitions, 2 changer transitions 2/69 dead transitions. [2025-02-08 08:21:32,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 272 flow [2025-02-08 08:21:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-02-08 08:21:32,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2025-02-08 08:21:32,705 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 102 transitions. [2025-02-08 08:21:32,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 272 flow [2025-02-08 08:21:32,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 268 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:21:32,715 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2025-02-08 08:21:32,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-02-08 08:21:32,719 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-02-08 08:21:32,719 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2025-02-08 08:21:32,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:32,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:32,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:32,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:21:32,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1178192524, now seen corresponding path program 1 times [2025-02-08 08:21:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:32,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591431512] [2025-02-08 08:21:32,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:32,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:21:32,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:21:32,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:32,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591431512] [2025-02-08 08:21:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591431512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:32,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:32,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:32,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857251602] [2025-02-08 08:21:32,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:32,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:32,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:32,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:32,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:32,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-02-08 08:21:32,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:32,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:32,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-02-08 08:21:32,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:35,812 INFO L124 PetriNetUnfolderBase]: 38795/54695 cut-off events. [2025-02-08 08:21:35,812 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2025-02-08 08:21:35,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108137 conditions, 54695 events. 38795/54695 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 357290 event pairs, 38795 based on Foata normal form. 1296/55714 useless extension candidates. Maximal degree in co-relation 108127. Up to 50976 conditions per place. [2025-02-08 08:21:36,400 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-02-08 08:21:36,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 170 flow [2025-02-08 08:21:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-02-08 08:21:36,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2025-02-08 08:21:36,406 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 70 transitions. [2025-02-08 08:21:36,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 170 flow [2025-02-08 08:21:36,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:36,435 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-02-08 08:21:36,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-02-08 08:21:36,437 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-02-08 08:21:36,437 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-02-08 08:21:36,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:36,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:36,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:36,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:21:36,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:36,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1178193438, now seen corresponding path program 1 times [2025-02-08 08:21:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:36,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934872368] [2025-02-08 08:21:36,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:36,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:21:36,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:21:36,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:36,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:36,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934872368] [2025-02-08 08:21:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934872368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:21:36,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593464713] [2025-02-08 08:21:36,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:21:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:36,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:21:36,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:21:36,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:36,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:36,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:36,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:36,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:39,215 INFO L124 PetriNetUnfolderBase]: 31611/45411 cut-off events. [2025-02-08 08:21:39,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:39,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88189 conditions, 45411 events. 31611/45411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 303946 event pairs, 3739 based on Foata normal form. 1296/46664 useless extension candidates. Maximal degree in co-relation 88183. Up to 26017 conditions per place. [2025-02-08 08:21:39,396 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 72 selfloop transitions, 6 changer transitions 1/86 dead transitions. [2025-02-08 08:21:39,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 346 flow [2025-02-08 08:21:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:21:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:21:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-02-08 08:21:39,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6084905660377359 [2025-02-08 08:21:39,398 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 4 states and 129 transitions. [2025-02-08 08:21:39,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 346 flow [2025-02-08 08:21:39,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:21:39,399 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 135 flow [2025-02-08 08:21:39,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-02-08 08:21:39,400 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2025-02-08 08:21:39,400 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 135 flow [2025-02-08 08:21:39,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:39,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:39,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:39,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:21:39,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:39,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1560555761, now seen corresponding path program 1 times [2025-02-08 08:21:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173376888] [2025-02-08 08:21:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:39,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:21:39,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:21:39,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:39,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173376888] [2025-02-08 08:21:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173376888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:39,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333426912] [2025-02-08 08:21:39,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:39,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:39,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:39,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:39,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:39,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:39,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:39,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:39,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:39,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:41,182 INFO L124 PetriNetUnfolderBase]: 20347/29283 cut-off events. [2025-02-08 08:21:41,183 INFO L125 PetriNetUnfolderBase]: For 5466/5466 co-relation queries the response was YES. [2025-02-08 08:21:41,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65156 conditions, 29283 events. 20347/29283 cut-off events. For 5466/5466 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 181911 event pairs, 2151 based on Foata normal form. 1040/30280 useless extension candidates. Maximal degree in co-relation 65147. Up to 12193 conditions per place. [2025-02-08 08:21:41,285 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 93 selfloop transitions, 10 changer transitions 1/111 dead transitions. [2025-02-08 08:21:41,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 502 flow [2025-02-08 08:21:41,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:21:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:21:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-02-08 08:21:41,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6264150943396226 [2025-02-08 08:21:41,287 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 135 flow. Second operand 5 states and 166 transitions. [2025-02-08 08:21:41,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 502 flow [2025-02-08 08:21:41,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 491 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:41,294 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 187 flow [2025-02-08 08:21:41,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-02-08 08:21:41,294 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2025-02-08 08:21:41,294 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 187 flow [2025-02-08 08:21:41,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:41,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:41,295 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-08 08:21:41,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:21:41,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -906606396, now seen corresponding path program 1 times [2025-02-08 08:21:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574718672] [2025-02-08 08:21:41,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:41,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:41,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:21:41,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:21:41,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:41,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:41,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:41,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574718672] [2025-02-08 08:21:41,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574718672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:41,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:41,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:21:41,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023272389] [2025-02-08 08:21:41,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:41,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:21:41,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:41,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:21:41,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:21:41,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:41,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:41,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:41,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:41,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:42,866 INFO L124 PetriNetUnfolderBase]: 12027/16995 cut-off events. [2025-02-08 08:21:42,866 INFO L125 PetriNetUnfolderBase]: For 10042/10042 co-relation queries the response was YES. [2025-02-08 08:21:42,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41808 conditions, 16995 events. 12027/16995 cut-off events. For 10042/10042 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 92511 event pairs, 1839 based on Foata normal form. 528/17480 useless extension candidates. Maximal degree in co-relation 41797. Up to 4800 conditions per place. [2025-02-08 08:21:42,916 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 112 selfloop transitions, 14 changer transitions 1/134 dead transitions. [2025-02-08 08:21:42,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 134 transitions, 657 flow [2025-02-08 08:21:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:21:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:21:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-02-08 08:21:42,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6320754716981132 [2025-02-08 08:21:42,918 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 187 flow. Second operand 6 states and 201 transitions. [2025-02-08 08:21:42,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 134 transitions, 657 flow [2025-02-08 08:21:42,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 134 transitions, 627 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 08:21:43,004 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 237 flow [2025-02-08 08:21:43,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-02-08 08:21:43,005 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-02-08 08:21:43,005 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 237 flow [2025-02-08 08:21:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:43,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:43,005 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, 1, 1] [2025-02-08 08:21:43,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:21:43,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:43,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash -461340433, now seen corresponding path program 1 times [2025-02-08 08:21:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:43,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408237709] [2025-02-08 08:21:43,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:43,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:21:43,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:21:43,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:43,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:43,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:43,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408237709] [2025-02-08 08:21:43,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408237709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:43,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:43,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:21:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471945405] [2025-02-08 08:21:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:43,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:21:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:43,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:21:43,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:21:43,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:43,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:43,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:43,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:43,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:44,317 INFO L124 PetriNetUnfolderBase]: 9083/12515 cut-off events. [2025-02-08 08:21:44,317 INFO L125 PetriNetUnfolderBase]: For 9858/9858 co-relation queries the response was YES. [2025-02-08 08:21:44,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32241 conditions, 12515 events. 9083/12515 cut-off events. For 9858/9858 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 64142 event pairs, 1687 based on Foata normal form. 144/12616 useless extension candidates. Maximal degree in co-relation 32229. Up to 4608 conditions per place. [2025-02-08 08:21:44,373 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 97 selfloop transitions, 18 changer transitions 1/123 dead transitions. [2025-02-08 08:21:44,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 123 transitions, 623 flow [2025-02-08 08:21:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:21:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:21:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2025-02-08 08:21:44,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444743935309974 [2025-02-08 08:21:44,375 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 237 flow. Second operand 7 states and 202 transitions. [2025-02-08 08:21:44,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 123 transitions, 623 flow [2025-02-08 08:21:44,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 577 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-08 08:21:44,503 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 247 flow [2025-02-08 08:21:44,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-02-08 08:21:44,504 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2025-02-08 08:21:44,504 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 247 flow [2025-02-08 08:21:44,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:44,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:44,505 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:44,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:21:44,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1616187026, now seen corresponding path program 1 times [2025-02-08 08:21:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940877164] [2025-02-08 08:21:44,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:44,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:21:44,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:21:44,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:44,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:45,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:45,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940877164] [2025-02-08 08:21:45,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940877164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:45,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:45,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:21:45,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293827742] [2025-02-08 08:21:45,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:45,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:21:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:45,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:21:45,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:21:45,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:45,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:45,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:45,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:45,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:46,743 INFO L124 PetriNetUnfolderBase]: 18261/25209 cut-off events. [2025-02-08 08:21:46,743 INFO L125 PetriNetUnfolderBase]: For 21984/21984 co-relation queries the response was YES. [2025-02-08 08:21:46,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65688 conditions, 25209 events. 18261/25209 cut-off events. For 21984/21984 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 142245 event pairs, 3499 based on Foata normal form. 16/25120 useless extension candidates. Maximal degree in co-relation 65675. Up to 11347 conditions per place. [2025-02-08 08:21:46,857 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 99 selfloop transitions, 11 changer transitions 25/142 dead transitions. [2025-02-08 08:21:46,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 142 transitions, 953 flow [2025-02-08 08:21:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:21:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:21:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2025-02-08 08:21:46,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408805031446541 [2025-02-08 08:21:46,858 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 247 flow. Second operand 6 states and 172 transitions. [2025-02-08 08:21:46,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 142 transitions, 953 flow [2025-02-08 08:21:47,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 671 flow, removed 51 selfloop flow, removed 10 redundant places. [2025-02-08 08:21:47,182 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 231 flow [2025-02-08 08:21:47,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-02-08 08:21:47,183 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2025-02-08 08:21:47,183 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 231 flow [2025-02-08 08:21:47,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:47,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:47,183 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:47,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:21:47,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1234501706, now seen corresponding path program 2 times [2025-02-08 08:21:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277956841] [2025-02-08 08:21:47,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:21:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:47,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:21:47,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:21:47,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:47,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277956841] [2025-02-08 08:21:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277956841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:47,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:47,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:21:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709264399] [2025-02-08 08:21:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:47,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:21:47,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:47,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:21:47,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:21:47,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:47,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 231 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:47,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:47,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:47,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:48,676 INFO L124 PetriNetUnfolderBase]: 15267/21319 cut-off events. [2025-02-08 08:21:48,676 INFO L125 PetriNetUnfolderBase]: For 9428/9428 co-relation queries the response was YES. [2025-02-08 08:21:48,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55282 conditions, 21319 events. 15267/21319 cut-off events. For 9428/9428 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 115385 event pairs, 1501 based on Foata normal form. 16/21330 useless extension candidates. Maximal degree in co-relation 55269. Up to 8736 conditions per place. [2025-02-08 08:21:48,780 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 83 selfloop transitions, 4 changer transitions 106/200 dead transitions. [2025-02-08 08:21:48,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 200 transitions, 1122 flow [2025-02-08 08:21:48,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:21:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:21:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2025-02-08 08:21:48,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4989517819706499 [2025-02-08 08:21:48,781 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 231 flow. Second operand 9 states and 238 transitions. [2025-02-08 08:21:48,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 200 transitions, 1122 flow [2025-02-08 08:21:48,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 200 transitions, 1099 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-08 08:21:48,786 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 235 flow [2025-02-08 08:21:48,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2025-02-08 08:21:48,786 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2025-02-08 08:21:48,787 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 235 flow [2025-02-08 08:21:48,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:48,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:48,787 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:48,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:21:48,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:48,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1731597350, now seen corresponding path program 3 times [2025-02-08 08:21:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:48,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691330586] [2025-02-08 08:21:48,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:21:48,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:48,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:21:48,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:21:48,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:21:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691330586] [2025-02-08 08:21:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691330586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:21:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616284185] [2025-02-08 08:21:49,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:49,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:21:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:49,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:21:49,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:21:49,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:49,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:49,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:49,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:49,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:50,281 INFO L124 PetriNetUnfolderBase]: 9451/13432 cut-off events. [2025-02-08 08:21:50,281 INFO L125 PetriNetUnfolderBase]: For 6846/6846 co-relation queries the response was YES. [2025-02-08 08:21:50,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34159 conditions, 13432 events. 9451/13432 cut-off events. For 6846/6846 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 71189 event pairs, 1932 based on Foata normal form. 16/13443 useless extension candidates. Maximal degree in co-relation 34142. Up to 6876 conditions per place. [2025-02-08 08:21:50,343 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 66 selfloop transitions, 8 changer transitions 48/129 dead transitions. [2025-02-08 08:21:50,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 129 transitions, 712 flow [2025-02-08 08:21:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:21:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:21:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-02-08 08:21:50,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4968553459119497 [2025-02-08 08:21:50,345 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 235 flow. Second operand 6 states and 158 transitions. [2025-02-08 08:21:50,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 129 transitions, 712 flow [2025-02-08 08:21:50,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 129 transitions, 694 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:21:50,368 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 243 flow [2025-02-08 08:21:50,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2025-02-08 08:21:50,369 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2025-02-08 08:21:50,369 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 243 flow [2025-02-08 08:21:50,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:50,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:50,370 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:50,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:21:50,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:50,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1581223784, now seen corresponding path program 4 times [2025-02-08 08:21:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:50,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647106460] [2025-02-08 08:21:50,370 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:21:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:50,379 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-08 08:21:50,427 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:21:50,427 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:21:50,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:51,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:51,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647106460] [2025-02-08 08:21:51,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647106460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:51,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:51,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:21:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844961641] [2025-02-08 08:21:51,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:51,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:21:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:51,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:21:51,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:21:51,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:51,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 243 flow. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:51,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:51,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:51,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:51,846 INFO L124 PetriNetUnfolderBase]: 4092/5909 cut-off events. [2025-02-08 08:21:51,846 INFO L125 PetriNetUnfolderBase]: For 3162/3162 co-relation queries the response was YES. [2025-02-08 08:21:51,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15060 conditions, 5909 events. 4092/5909 cut-off events. For 3162/3162 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 27712 event pairs, 1192 based on Foata normal form. 16/5924 useless extension candidates. Maximal degree in co-relation 15042. Up to 3008 conditions per place. [2025-02-08 08:21:51,862 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 61 selfloop transitions, 3 changer transitions 46/117 dead transitions. [2025-02-08 08:21:51,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 117 transitions, 671 flow [2025-02-08 08:21:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:21:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:21:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-02-08 08:21:51,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4339622641509434 [2025-02-08 08:21:51,864 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 243 flow. Second operand 7 states and 161 transitions. [2025-02-08 08:21:51,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 117 transitions, 671 flow [2025-02-08 08:21:51,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 117 transitions, 616 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-08 08:21:51,867 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 205 flow [2025-02-08 08:21:51,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2025-02-08 08:21:51,869 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2025-02-08 08:21:51,869 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 205 flow [2025-02-08 08:21:51,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:51,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:51,869 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:51,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:21:51,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:51,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash -577003984, now seen corresponding path program 5 times [2025-02-08 08:21:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:51,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483770334] [2025-02-08 08:21:51,871 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:21:51,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:51,879 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:21:51,913 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:21:51,913 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:51,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:21:51,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:21:51,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:21:51,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:21:51,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:51,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:21:51,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:21:51,983 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:21:51,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-02-08 08:21:51,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-02-08 08:21:51,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-02-08 08:21:51,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-02-08 08:21:51,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-02-08 08:21:51,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-02-08 08:21:51,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-02-08 08:21:51,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-08 08:21:51,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:21:51,986 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:52,074 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:21:52,075 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:21:52,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:21:52 BasicIcfg [2025-02-08 08:21:52,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:21:52,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:21:52,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:21:52,080 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:21:52,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:28" (3/4) ... [2025-02-08 08:21:52,082 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:21:52,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:21:52,084 INFO L158 Benchmark]: Toolchain (without parser) took 25368.04ms. Allocated memory was 201.3MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 156.9MB in the beginning and 4.8GB in the end (delta: -4.6GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2025-02-08 08:21:52,084 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 218.1MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:52,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.80ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 133.5MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:21:52,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.32ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 131.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:52,085 INFO L158 Benchmark]: Boogie Preprocessor took 47.49ms. Allocated memory is still 201.3MB. Free memory was 131.2MB in the beginning and 128.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:52,085 INFO L158 Benchmark]: IcfgBuilder took 791.19ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 73.0MB in the end (delta: 55.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 08:21:52,086 INFO L158 Benchmark]: TraceAbstraction took 24042.25ms. Allocated memory was 201.3MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 72.5MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2025-02-08 08:21:52,086 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 8.3GB. Free memory was 4.8GB in the beginning and 4.8GB in the end (delta: 530.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:21:52,087 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 218.1MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.80ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 133.5MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.32ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 131.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.49ms. Allocated memory is still 201.3MB. Free memory was 131.2MB in the beginning and 128.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 791.19ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 73.0MB in the end (delta: 55.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24042.25ms. Allocated memory was 201.3MB in the beginning and 8.3GB in the end (delta: 8.1GB). Free memory was 72.5MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 8.3GB. Free memory was 4.8GB in the beginning and 4.8GB in the end (delta: 530.9kB). Peak memory consumption was 8.4MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-1, t1518=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, t1520=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L809] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L746] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L749] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L761] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L764] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L776] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L779] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L782] 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) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 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 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, t1520=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, t1520=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 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) [L859] 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)) [L860] 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)) [L861] 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)) [L862] 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)) [L863] 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)) [L864] 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)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, t1520=2, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L869] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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", "mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 835]: 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: 841]: 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: 837]: 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: 839]: 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 9 procedures, 85 locations, 8 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: 23.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 924 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 916 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1976 IncrementalHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 6 mSDtfsCounter, 1976 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=6, InterpolantAutomatonStates: 56, 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.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-08 08:21:52,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:21:54,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:21:54,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:21:54,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:21:54,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:21:55,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:21:55,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:21:55,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:21:55,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:21:55,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:21:55,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:21:55,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:21:55,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:21:55,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:55,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:21:55,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:21:55,003 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2025-02-08 08:21:55,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:21:55,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:21:55,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:21:55,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:21:55,236 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:21:55,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:56,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8751e40f4/8846350aafa648fc8ff6c16d434a8259/FLAG2e11a8689 [2025-02-08 08:21:56,998 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:21:57,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:57,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8751e40f4/8846350aafa648fc8ff6c16d434a8259/FLAG2e11a8689 [2025-02-08 08:21:57,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8751e40f4/8846350aafa648fc8ff6c16d434a8259 [2025-02-08 08:21:57,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:21:57,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:21:57,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:57,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:21:57,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:21:57,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88a877f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57, skipping insertion in model container [2025-02-08 08:21:57,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:21:57,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:57,579 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:21:57,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:57,678 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:21:57,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57 WrapperNode [2025-02-08 08:21:57,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:57,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:57,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:21:57,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:21:57,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,734 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2025-02-08 08:21:57,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:57,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:21:57,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:21:57,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:21:57,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,772 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:21:57,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:21:57,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:21:57,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:21:57,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:21:57,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:57,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:57,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:21:57,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:21:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:21:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:21:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:21:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:21:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:21:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:21:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:21:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:21:57,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:21:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-08 08:21:57,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-08 08:21:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:21:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:21:57,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:21:57,867 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:21:58,023 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:21:58,025 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:21:58,470 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:21:58,471 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:21:58,853 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:21:58,854 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:21:58,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:58 BoogieIcfgContainer [2025-02-08 08:21:58,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:21:58,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:21:58,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:21:58,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:21:58,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:21:57" (1/3) ... [2025-02-08 08:21:58,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514020c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:58, skipping insertion in model container [2025-02-08 08:21:58,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (2/3) ... [2025-02-08 08:21:58,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514020c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:58, skipping insertion in model container [2025-02-08 08:21:58,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:58" (3/3) ... [2025-02-08 08:21:58,865 INFO L128 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:58,876 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:21:58,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:21:58,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:21:58,967 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:21:58,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2025-02-08 08:21:59,030 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-02-08 08:21:59,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:59,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-02-08 08:21:59,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2025-02-08 08:21:59,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2025-02-08 08:21:59,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:21:59,061 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;@7909c498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:21:59,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:21:59,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:21:59,071 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 08:21:59,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:59,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:59,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:59,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:21:59,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -53224499, now seen corresponding path program 1 times [2025-02-08 08:21:59,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917112879] [2025-02-08 08:21:59,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:59,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:59,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:21:59,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:21:59,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:21:59,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:21:59,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:59,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:21:59,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:59,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:59,258 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:59,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917112879] [2025-02-08 08:21:59,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917112879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:59,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896108124] [2025-02-08 08:21:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:59,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:59,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:59,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:59,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:59,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:21:59,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:59,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:59,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:21:59,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:03,149 INFO L124 PetriNetUnfolderBase]: 43115/57503 cut-off events. [2025-02-08 08:22:03,149 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-02-08 08:22:03,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114619 conditions, 57503 events. 43115/57503 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 1721. Compared 337749 event pairs, 6395 based on Foata normal form. 2592/60034 useless extension candidates. Maximal degree in co-relation 114607. Up to 47521 conditions per place. [2025-02-08 08:22:03,655 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 57 selfloop transitions, 2 changer transitions 2/69 dead transitions. [2025-02-08 08:22:03,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 272 flow [2025-02-08 08:22:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:22:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:22:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-02-08 08:22:03,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2025-02-08 08:22:03,664 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 102 transitions. [2025-02-08 08:22:03,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 272 flow [2025-02-08 08:22:03,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 268 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:22:03,674 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2025-02-08 08:22:03,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-02-08 08:22:03,682 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-02-08 08:22:03,682 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2025-02-08 08:22:03,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:03,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:03,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:03,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:22:03,883 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-08 08:22:03,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:03,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2037921650, now seen corresponding path program 1 times [2025-02-08 08:22:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:03,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106130333] [2025-02-08 08:22:03,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:22:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:03,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:03,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:22:03,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:22:03,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:22:03,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:22:03,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:03,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:03,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:22:03,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:04,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:04,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106130333] [2025-02-08 08:22:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106130333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:04,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:04,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:22:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194929329] [2025-02-08 08:22:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:04,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:22:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:04,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:22:04,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:22:04,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-02-08 08:22:04,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:04,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:04,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-02-08 08:22:04,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:06,795 INFO L124 PetriNetUnfolderBase]: 38795/54695 cut-off events. [2025-02-08 08:22:06,795 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2025-02-08 08:22:06,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108137 conditions, 54695 events. 38795/54695 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 357290 event pairs, 38795 based on Foata normal form. 1296/55714 useless extension candidates. Maximal degree in co-relation 108127. Up to 50976 conditions per place. [2025-02-08 08:22:07,039 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-02-08 08:22:07,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 170 flow [2025-02-08 08:22:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:22:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:22:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-02-08 08:22:07,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2025-02-08 08:22:07,041 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 70 transitions. [2025-02-08 08:22:07,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 170 flow [2025-02-08 08:22:07,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:22:07,054 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-02-08 08:22:07,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-02-08 08:22:07,054 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-02-08 08:22:07,055 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-02-08 08:22:07,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:07,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:07,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:07,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:22:07,255 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-08 08:22:07,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:07,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2037920736, now seen corresponding path program 1 times [2025-02-08 08:22:07,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845566418] [2025-02-08 08:22:07,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:22:07,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:07,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:07,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:22:07,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:22:07,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:22:07,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:22:07,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:07,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:07,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:22:07,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:07,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:07,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:07,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845566418] [2025-02-08 08:22:07,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845566418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:07,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:07,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:22:07,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389356197] [2025-02-08 08:22:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:07,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:22:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:07,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:22:07,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:22:07,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:22:07,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:07,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:07,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:22:07,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:09,580 INFO L124 PetriNetUnfolderBase]: 31611/45411 cut-off events. [2025-02-08 08:22:09,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:22:09,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88189 conditions, 45411 events. 31611/45411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 303946 event pairs, 3739 based on Foata normal form. 1296/46664 useless extension candidates. Maximal degree in co-relation 88183. Up to 26017 conditions per place. [2025-02-08 08:22:09,790 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 72 selfloop transitions, 6 changer transitions 1/86 dead transitions. [2025-02-08 08:22:09,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 346 flow [2025-02-08 08:22:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:22:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:22:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-02-08 08:22:09,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6084905660377359 [2025-02-08 08:22:09,792 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 4 states and 129 transitions. [2025-02-08 08:22:09,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 346 flow [2025-02-08 08:22:09,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:22:09,794 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 135 flow [2025-02-08 08:22:09,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-02-08 08:22:09,795 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2025-02-08 08:22:09,795 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 135 flow [2025-02-08 08:22:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:09,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:09,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:09,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:22:09,999 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-08 08:22:09,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash -45915697, now seen corresponding path program 1 times [2025-02-08 08:22:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:10,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545359060] [2025-02-08 08:22:10,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:22:10,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:10,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:10,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:22:10,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:22:10,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:22:10,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:22:10,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:10,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:10,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:22:10,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:10,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:10,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:10,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545359060] [2025-02-08 08:22:10,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545359060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:10,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:10,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:22:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88781494] [2025-02-08 08:22:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:10,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:22:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:10,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:22:10,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:22:10,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:22:10,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:10,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:10,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:22:10,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:11,754 INFO L124 PetriNetUnfolderBase]: 20347/29283 cut-off events. [2025-02-08 08:22:11,754 INFO L125 PetriNetUnfolderBase]: For 5466/5466 co-relation queries the response was YES. [2025-02-08 08:22:11,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65156 conditions, 29283 events. 20347/29283 cut-off events. For 5466/5466 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 181666 event pairs, 2151 based on Foata normal form. 1040/30280 useless extension candidates. Maximal degree in co-relation 65147. Up to 12193 conditions per place. [2025-02-08 08:22:11,922 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 93 selfloop transitions, 10 changer transitions 1/111 dead transitions. [2025-02-08 08:22:11,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 502 flow [2025-02-08 08:22:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:22:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:22:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-02-08 08:22:11,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6264150943396226 [2025-02-08 08:22:11,924 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 135 flow. Second operand 5 states and 166 transitions. [2025-02-08 08:22:11,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 502 flow [2025-02-08 08:22:11,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 491 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:22:11,932 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 187 flow [2025-02-08 08:22:11,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-02-08 08:22:11,933 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2025-02-08 08:22:11,933 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 187 flow [2025-02-08 08:22:11,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:11,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:11,933 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-08 08:22:11,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:22:12,137 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-08 08:22:12,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:12,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash 794398086, now seen corresponding path program 1 times [2025-02-08 08:22:12,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:12,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49010890] [2025-02-08 08:22:12,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:22:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:12,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:12,140 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-08 08:22:12,141 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-08 08:22:12,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:22:12,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:22:12,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:12,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:12,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:22:12,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:12,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:12,293 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:12,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49010890] [2025-02-08 08:22:12,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49010890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:12,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:22:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444990703] [2025-02-08 08:22:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:12,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:22:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:12,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:22:12,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:22:12,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:22:12,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:12,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:12,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:22:12,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:13,429 INFO L124 PetriNetUnfolderBase]: 12027/16995 cut-off events. [2025-02-08 08:22:13,429 INFO L125 PetriNetUnfolderBase]: For 10042/10042 co-relation queries the response was YES. [2025-02-08 08:22:13,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41808 conditions, 16995 events. 12027/16995 cut-off events. For 10042/10042 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 92587 event pairs, 1839 based on Foata normal form. 528/17480 useless extension candidates. Maximal degree in co-relation 41797. Up to 4800 conditions per place. [2025-02-08 08:22:13,526 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 112 selfloop transitions, 14 changer transitions 1/134 dead transitions. [2025-02-08 08:22:13,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 134 transitions, 657 flow [2025-02-08 08:22:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:22:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:22:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-02-08 08:22:13,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6320754716981132 [2025-02-08 08:22:13,528 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 187 flow. Second operand 6 states and 201 transitions. [2025-02-08 08:22:13,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 134 transitions, 657 flow [2025-02-08 08:22:13,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 134 transitions, 627 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 08:22:13,627 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 237 flow [2025-02-08 08:22:13,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-02-08 08:22:13,630 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-02-08 08:22:13,630 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 237 flow [2025-02-08 08:22:13,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:13,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:13,631 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, 1, 1] [2025-02-08 08:22:13,638 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-08 08:22:13,836 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-08 08:22:13,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1179581201, now seen corresponding path program 1 times [2025-02-08 08:22:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103745951] [2025-02-08 08:22:13,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:22:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:13,840 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-08 08:22:13,843 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-08 08:22:13,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:22:13,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:22:13,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:13,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:13,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:22:13,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:13,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:13,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:13,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103745951] [2025-02-08 08:22:13,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103745951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:13,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:13,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:22:13,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992949591] [2025-02-08 08:22:13,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:13,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:22:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:13,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:22:13,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:22:13,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:22:13,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:13,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:13,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:22:13,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:14,666 INFO L124 PetriNetUnfolderBase]: 9083/12515 cut-off events. [2025-02-08 08:22:14,666 INFO L125 PetriNetUnfolderBase]: For 9858/9858 co-relation queries the response was YES. [2025-02-08 08:22:14,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32241 conditions, 12515 events. 9083/12515 cut-off events. For 9858/9858 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 64144 event pairs, 1687 based on Foata normal form. 144/12616 useless extension candidates. Maximal degree in co-relation 32229. Up to 4608 conditions per place. [2025-02-08 08:22:14,731 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 97 selfloop transitions, 18 changer transitions 1/123 dead transitions. [2025-02-08 08:22:14,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 123 transitions, 623 flow [2025-02-08 08:22:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:22:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:22:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2025-02-08 08:22:14,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444743935309974 [2025-02-08 08:22:14,733 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 237 flow. Second operand 7 states and 202 transitions. [2025-02-08 08:22:14,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 123 transitions, 623 flow [2025-02-08 08:22:14,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 577 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-08 08:22:14,861 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 247 flow [2025-02-08 08:22:14,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-02-08 08:22:14,862 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2025-02-08 08:22:14,862 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 247 flow [2025-02-08 08:22:14,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:14,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:14,862 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:14,868 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-08 08:22:15,065 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-08 08:22:15,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:15,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -934671120, now seen corresponding path program 1 times [2025-02-08 08:22:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642646231] [2025-02-08 08:22:15,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:22:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:15,069 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-08 08:22:15,070 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-08 08:22:15,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:22:15,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:22:15,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:15,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:15,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:22:15,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:15,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:15,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:15,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642646231] [2025-02-08 08:22:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642646231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:22:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794605359] [2025-02-08 08:22:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:15,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:22:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:15,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:22:15,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:22:15,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:22:15,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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-08 08:22:15,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:15,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:22:15,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:16,632 INFO L124 PetriNetUnfolderBase]: 12819/17618 cut-off events. [2025-02-08 08:22:16,633 INFO L125 PetriNetUnfolderBase]: For 14152/14152 co-relation queries the response was YES. [2025-02-08 08:22:16,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45465 conditions, 17618 events. 12819/17618 cut-off events. For 14152/14152 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 95530 event pairs, 1723 based on Foata normal form. 16/17623 useless extension candidates. Maximal degree in co-relation 45452. Up to 10078 conditions per place. [2025-02-08 08:22:16,707 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 66 selfloop transitions, 1 changer transitions 55/129 dead transitions. [2025-02-08 08:22:16,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 129 transitions, 827 flow [2025-02-08 08:22:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:22:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:22:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-02-08 08:22:16,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.477088948787062 [2025-02-08 08:22:16,708 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 247 flow. Second operand 7 states and 177 transitions. [2025-02-08 08:22:16,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 129 transitions, 827 flow [2025-02-08 08:22:16,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 129 transitions, 602 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-02-08 08:22:16,845 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 164 flow [2025-02-08 08:22:16,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2025-02-08 08:22:16,846 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-02-08 08:22:16,846 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 164 flow [2025-02-08 08:22:16,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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-08 08:22:16,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:16,846 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:16,853 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-08 08:22:17,047 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-08 08:22:17,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1551699496, now seen corresponding path program 2 times [2025-02-08 08:22:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959981010] [2025-02-08 08:22:17,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:22:17,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:17,054 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-08 08:22:17,056 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-08 08:22:17,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:22:17,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:22:17,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:22:17,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:17,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:22:17,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:17,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:17,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:17,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959981010] [2025-02-08 08:22:17,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959981010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:17,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:17,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:22:17,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474658903] [2025-02-08 08:22:17,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:17,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:22:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:17,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:22:17,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:22:17,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:22:17,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:17,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:17,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:22:17,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:18,138 INFO L124 PetriNetUnfolderBase]: 12853/17961 cut-off events. [2025-02-08 08:22:18,139 INFO L125 PetriNetUnfolderBase]: For 3220/3220 co-relation queries the response was YES. [2025-02-08 08:22:18,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40593 conditions, 17961 events. 12853/17961 cut-off events. For 3220/3220 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 102076 event pairs, 5879 based on Foata normal form. 16/17927 useless extension candidates. Maximal degree in co-relation 40581. Up to 10131 conditions per place. [2025-02-08 08:22:18,233 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 63 selfloop transitions, 2 changer transitions 35/107 dead transitions. [2025-02-08 08:22:18,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 515 flow [2025-02-08 08:22:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:22:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:22:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-02-08 08:22:18,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46855345911949686 [2025-02-08 08:22:18,235 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 164 flow. Second operand 6 states and 149 transitions. [2025-02-08 08:22:18,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 515 flow [2025-02-08 08:22:18,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 500 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:22:18,238 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 169 flow [2025-02-08 08:22:18,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2025-02-08 08:22:18,238 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-02-08 08:22:18,238 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 169 flow [2025-02-08 08:22:18,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:18,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:18,239 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:18,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:22:18,443 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-08 08:22:18,443 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 710255120, now seen corresponding path program 3 times [2025-02-08 08:22:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1276055745] [2025-02-08 08:22:18,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:22:18,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:18,447 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-08 08:22:18,448 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-08 08:22:18,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:22:18,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:22:18,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:22:18,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:18,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:22:18,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:18,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:18,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276055745] [2025-02-08 08:22:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276055745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:18,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:22:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969517094] [2025-02-08 08:22:18,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:18,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:22:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:18,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:22:18,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:22:18,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-02-08 08:22:18,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:18,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:18,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-02-08 08:22:18,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:19,129 INFO L124 PetriNetUnfolderBase]: 8683/12319 cut-off events. [2025-02-08 08:22:19,129 INFO L125 PetriNetUnfolderBase]: For 2002/2004 co-relation queries the response was YES. [2025-02-08 08:22:19,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28565 conditions, 12319 events. 8683/12319 cut-off events. For 2002/2004 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 65435 event pairs, 3855 based on Foata normal form. 16/12310 useless extension candidates. Maximal degree in co-relation 28553. Up to 7117 conditions per place. [2025-02-08 08:22:19,189 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 61 selfloop transitions, 2 changer transitions 33/103 dead transitions. [2025-02-08 08:22:19,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 502 flow [2025-02-08 08:22:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:22:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:22:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-08 08:22:19,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4559748427672956 [2025-02-08 08:22:19,190 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 169 flow. Second operand 6 states and 145 transitions. [2025-02-08 08:22:19,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 502 flow [2025-02-08 08:22:19,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 484 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:22:19,194 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 171 flow [2025-02-08 08:22:19,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-02-08 08:22:19,195 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2025-02-08 08:22:19,195 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 171 flow [2025-02-08 08:22:19,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:19,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:19,195 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:19,202 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-08 08:22:19,400 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-08 08:22:19,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-08 08:22:19,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 778058314, now seen corresponding path program 4 times [2025-02-08 08:22:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:19,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105531242] [2025-02-08 08:22:19,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:22:19,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:19,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:19,406 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-08 08:22:19,407 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-08 08:22:19,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-08 08:22:19,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:22:19,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:22:19,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:22:19,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:22:19,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:22:19,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:22:19,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:19,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:22:19,546 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:22:19,547 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:22:19,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-02-08 08:22:19,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-02-08 08:22:19,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-02-08 08:22:19,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-02-08 08:22:19,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-02-08 08:22:19,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-02-08 08:22:19,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-02-08 08:22:19,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-08 08:22:19,556 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-08 08:22:19,750 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-08 08:22:19,751 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:19,809 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:22:19,809 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:22:19,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:22:19 BasicIcfg [2025-02-08 08:22:19,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:22:19,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:22:19,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:22:19,813 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:22:19,814 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:58" (3/4) ... [2025-02-08 08:22:19,815 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:22:19,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:22:19,816 INFO L158 Benchmark]: Toolchain (without parser) took 22503.31ms. Allocated memory was 83.9MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 57.7MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-02-08 08:22:19,817 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:19,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.25ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 34.1MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:22:19,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.56ms. Allocated memory is still 83.9MB. Free memory was 34.1MB in the beginning and 31.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:19,818 INFO L158 Benchmark]: Boogie Preprocessor took 61.03ms. Allocated memory is still 83.9MB. Free memory was 31.7MB in the beginning and 28.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:19,818 INFO L158 Benchmark]: IcfgBuilder took 1057.55ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 28.9MB in the beginning and 44.0MB in the end (delta: -15.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2025-02-08 08:22:19,818 INFO L158 Benchmark]: TraceAbstraction took 20955.91ms. Allocated memory was 109.1MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 43.5MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-02-08 08:22:19,819 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 9.6GB. Free memory was 7.7GB in the beginning and 7.7GB in the end (delta: 49.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:22:19,820 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.28ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.25ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 34.1MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.56ms. Allocated memory is still 83.9MB. Free memory was 34.1MB in the beginning and 31.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.03ms. Allocated memory is still 83.9MB. Free memory was 31.7MB in the beginning and 28.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1057.55ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 28.9MB in the beginning and 44.0MB in the end (delta: -15.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20955.91ms. Allocated memory was 109.1MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 43.5MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 9.6GB. Free memory was 7.7GB in the beginning and 7.7GB in the end (delta: 49.1kB). Peak memory consumption was 8.4MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-3, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-3, t1518=-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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-3, t1518=-2, t1519=-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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-3, t1518=-2, t1519=-1, t1520=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L809] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L746] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L749] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L761] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=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=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L764] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=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=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=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=2, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L776] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L779] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L782] 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) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 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 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 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}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=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=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-3, t1518=-2, t1519=-1, t1520=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-3, t1518=-2, t1519=-1, t1520=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 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) [L859] 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)) [L860] 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)) [L861] 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)) [L862] 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)) [L863] 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)) [L864] 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)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-3, t1518=-2, t1519=-1, t1520=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L869] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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", "mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 835]: 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: 841]: 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: 837]: 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 9 procedures, 85 locations, 8 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: 20.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 667 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 661 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2064 IncrementalHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1 mSDtfsCounter, 2064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=6, InterpolantAutomatonStates: 47, 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.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1072 ConjunctsInSsa, 51 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-08 08:22:19,840 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