./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix054_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 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:47:19,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:47:19,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:47:19,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:47:19,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:47:19,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:47:19,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:47:19,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:47:19,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:47:19,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:47:19,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:47:19,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:47:19,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:47:19,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:47:19,963 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:47:19,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:47:19,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:19,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:47:19,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:19,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:47:19,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:47:19,965 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2025-01-10 00:47:20,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:47:20,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:47:20,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:47:20,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:47:20,184 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:47:20,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:21,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72e703d30/ee7a93cdd40f48eb8cf460876a5bbb73/FLAG62452b040 [2025-01-10 00:47:21,637 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:47:21,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:21,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72e703d30/ee7a93cdd40f48eb8cf460876a5bbb73/FLAG62452b040 [2025-01-10 00:47:21,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72e703d30/ee7a93cdd40f48eb8cf460876a5bbb73 [2025-01-10 00:47:21,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:47:21,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:47:21,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:21,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:47:21,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:47:21,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:21" (1/1) ... [2025-01-10 00:47:21,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242ba109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:21, skipping insertion in model container [2025-01-10 00:47:21,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:21" (1/1) ... [2025-01-10 00:47:21,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:47:22,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:22,212 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:47:22,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:22,289 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:47:22,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22 WrapperNode [2025-01-10 00:47:22,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:22,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:22,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:47:22,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:47:22,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,343 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2025-01-10 00:47:22,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:22,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:47:22,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:47:22,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:47:22,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,382 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:47:22,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:47:22,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:47:22,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:47:22,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:47:22,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (1/1) ... [2025-01-10 00:47:22,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:22,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:47:22,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:47:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:47:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:47:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:47:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:47:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:47:22,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:47:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:47:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:47:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:47:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:47:22,481 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:47:22,600 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:47:22,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:47:22,847 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:47:22,847 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:47:22,996 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:47:22,999 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:47:22,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:22 BoogieIcfgContainer [2025-01-10 00:47:22,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:47:23,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:47:23,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:47:23,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:47:23,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:47:21" (1/3) ... [2025-01-10 00:47:23,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5756717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:23, skipping insertion in model container [2025-01-10 00:47:23,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:22" (2/3) ... [2025-01-10 00:47:23,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5756717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:23, skipping insertion in model container [2025-01-10 00:47:23,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:22" (3/3) ... [2025-01-10 00:47:23,008 INFO L128 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:23,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:47:23,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:47:23,019 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:47:23,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:47:23,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2025-01-10 00:47:23,093 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-01-10 00:47:23,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:23,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-01-10 00:47:23,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2025-01-10 00:47:23,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-01-10 00:47:23,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:47:23,111 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;@2f862f8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:47:23,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:47:23,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:47:23,114 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 00:47:23,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:23,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:23,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:47:23,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:23,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1573353172, now seen corresponding path program 1 times [2025-01-10 00:47:23,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:23,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015748235] [2025-01-10 00:47:23,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:23,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:47:23,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:47:23,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:23,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:23,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:23,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015748235] [2025-01-10 00:47:23,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015748235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:23,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:23,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:23,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821070749] [2025-01-10 00:47:23,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:23,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:23,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:23,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:23,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:23,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-10 00:47:23,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:23,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:23,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-10 00:47:23,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:23,611 INFO L124 PetriNetUnfolderBase]: 146/337 cut-off events. [2025-01-10 00:47:23,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:23,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 337 events. 146/337 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1789 event pairs, 20 based on Foata normal form. 24/355 useless extension candidates. Maximal degree in co-relation 600. Up to 208 conditions per place. [2025-01-10 00:47:23,614 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2025-01-10 00:47:23,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2025-01-10 00:47:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-01-10 00:47:23,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-01-10 00:47:23,628 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 74 transitions. [2025-01-10 00:47:23,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2025-01-10 00:47:23,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:23,636 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-01-10 00:47:23,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-01-10 00:47:23,640 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-01-10 00:47:23,641 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-01-10 00:47:23,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:23,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:23,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:47:23,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1269111514, now seen corresponding path program 1 times [2025-01-10 00:47:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965244427] [2025-01-10 00:47:23,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:23,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:47:23,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:47:23,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:23,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:23,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965244427] [2025-01-10 00:47:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965244427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:23,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:23,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:23,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393390097] [2025-01-10 00:47:23,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:23,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:23,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:23,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:23,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 00:47:23,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:23,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:23,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 00:47:23,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:23,853 INFO L124 PetriNetUnfolderBase]: 129/293 cut-off events. [2025-01-10 00:47:23,853 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-10 00:47:23,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 293 events. 129/293 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1581 event pairs, 129 based on Foata normal form. 12/293 useless extension candidates. Maximal degree in co-relation 551. Up to 232 conditions per place. [2025-01-10 00:47:23,856 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-01-10 00:47:23,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 94 flow [2025-01-10 00:47:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-01-10 00:47:23,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-10 00:47:23,858 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 56 transitions. [2025-01-10 00:47:23,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 94 flow [2025-01-10 00:47:23,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:23,858 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2025-01-10 00:47:23,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-01-10 00:47:23,859 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-01-10 00:47:23,859 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2025-01-10 00:47:23,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:23,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:23,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:23,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:47:23,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1269112886, now seen corresponding path program 1 times [2025-01-10 00:47:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101002578] [2025-01-10 00:47:23,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:23,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:47:23,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:47:23,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:23,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:24,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101002578] [2025-01-10 00:47:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101002578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:47:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977580514] [2025-01-10 00:47:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:24,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:24,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:24,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:24,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-01-10 00:47:24,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:24,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:24,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-01-10 00:47:24,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:24,642 INFO L124 PetriNetUnfolderBase]: 232/491 cut-off events. [2025-01-10 00:47:24,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:24,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 491 events. 232/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2687 event pairs, 87 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 912. Up to 265 conditions per place. [2025-01-10 00:47:24,646 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 20 selfloop transitions, 3 changer transitions 28/60 dead transitions. [2025-01-10 00:47:24,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 230 flow [2025-01-10 00:47:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:47:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:47:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-01-10 00:47:24,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-01-10 00:47:24,649 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 8 states and 149 transitions. [2025-01-10 00:47:24,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 230 flow [2025-01-10 00:47:24,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:47:24,650 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 90 flow [2025-01-10 00:47:24,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2025-01-10 00:47:24,651 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-01-10 00:47:24,651 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 90 flow [2025-01-10 00:47:24,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:24,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:24,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:24,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:47:24,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:24,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1399698970, now seen corresponding path program 1 times [2025-01-10 00:47:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28669499] [2025-01-10 00:47:24,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:24,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:47:24,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:47:24,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:24,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:25,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28669499] [2025-01-10 00:47:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28669499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:25,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:25,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:47:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687028055] [2025-01-10 00:47:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:25,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:47:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:25,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:47:25,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:47:25,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-01-10 00:47:25,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:25,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:25,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-01-10 00:47:25,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:25,910 INFO L124 PetriNetUnfolderBase]: 324/627 cut-off events. [2025-01-10 00:47:25,910 INFO L125 PetriNetUnfolderBase]: For 470/470 co-relation queries the response was YES. [2025-01-10 00:47:25,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 627 events. 324/627 cut-off events. For 470/470 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3067 event pairs, 30 based on Foata normal form. 27/652 useless extension candidates. Maximal degree in co-relation 1566. Up to 349 conditions per place. [2025-01-10 00:47:25,913 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 32 selfloop transitions, 7 changer transitions 37/83 dead transitions. [2025-01-10 00:47:25,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 414 flow [2025-01-10 00:47:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:47:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:47:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions. [2025-01-10 00:47:25,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-01-10 00:47:25,919 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 90 flow. Second operand 11 states and 189 transitions. [2025-01-10 00:47:25,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 414 flow [2025-01-10 00:47:25,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 83 transitions, 395 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-01-10 00:47:25,926 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 138 flow [2025-01-10 00:47:25,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=138, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2025-01-10 00:47:25,927 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-01-10 00:47:25,927 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 138 flow [2025-01-10 00:47:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:25,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:25,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:25,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:47:25,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 8564440, now seen corresponding path program 2 times [2025-01-10 00:47:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092898641] [2025-01-10 00:47:25,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:47:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:25,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:47:25,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:47:25,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:47:25,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:26,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092898641] [2025-01-10 00:47:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092898641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:26,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:26,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:47:26,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022589668] [2025-01-10 00:47:26,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:26,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:47:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:26,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:47:26,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:47:26,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-01-10 00:47:26,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 138 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:26,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:26,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-01-10 00:47:26,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:26,636 INFO L124 PetriNetUnfolderBase]: 300/588 cut-off events. [2025-01-10 00:47:26,636 INFO L125 PetriNetUnfolderBase]: For 1292/1292 co-relation queries the response was YES. [2025-01-10 00:47:26,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 588 events. 300/588 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2819 event pairs, 36 based on Foata normal form. 23/609 useless extension candidates. Maximal degree in co-relation 1932. Up to 328 conditions per place. [2025-01-10 00:47:26,640 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 33 selfloop transitions, 8 changer transitions 27/75 dead transitions. [2025-01-10 00:47:26,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 488 flow [2025-01-10 00:47:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:47:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:47:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2025-01-10 00:47:26,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5015873015873016 [2025-01-10 00:47:26,641 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 138 flow. Second operand 9 states and 158 transitions. [2025-01-10 00:47:26,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 488 flow [2025-01-10 00:47:26,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 461 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-01-10 00:47:26,645 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 179 flow [2025-01-10 00:47:26,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=179, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2025-01-10 00:47:26,645 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-01-10 00:47:26,646 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 179 flow [2025-01-10 00:47:26,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:26,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:26,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:26,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:47:26,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1098785011, now seen corresponding path program 1 times [2025-01-10 00:47:26,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:26,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796039801] [2025-01-10 00:47:26,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:26,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:26,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:47:26,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:47:26,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:26,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:26,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:26,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796039801] [2025-01-10 00:47:26,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796039801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:26,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:26,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:47:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312822388] [2025-01-10 00:47:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:26,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:47:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:26,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:47:26,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:47:26,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-10 00:47:26,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:26,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:26,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-10 00:47:26,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:26,893 INFO L124 PetriNetUnfolderBase]: 210/436 cut-off events. [2025-01-10 00:47:26,893 INFO L125 PetriNetUnfolderBase]: For 1304/1304 co-relation queries the response was YES. [2025-01-10 00:47:26,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 436 events. 210/436 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1932 event pairs, 27 based on Foata normal form. 27/455 useless extension candidates. Maximal degree in co-relation 1472. Up to 220 conditions per place. [2025-01-10 00:47:26,900 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 37 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-01-10 00:47:26,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 360 flow [2025-01-10 00:47:26,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:47:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:47:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-01-10 00:47:26,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:47:26,906 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 179 flow. Second operand 4 states and 80 transitions. [2025-01-10 00:47:26,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 360 flow [2025-01-10 00:47:26,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 311 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-01-10 00:47:26,911 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 169 flow [2025-01-10 00:47:26,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-01-10 00:47:26,913 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-01-10 00:47:26,913 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 169 flow [2025-01-10 00:47:26,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:26,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:26,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:26,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:47:26,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:26,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1156504817, now seen corresponding path program 1 times [2025-01-10 00:47:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:26,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951260749] [2025-01-10 00:47:26,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:26,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:47:26,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:47:26,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:26,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:27,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:27,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951260749] [2025-01-10 00:47:27,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951260749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:27,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:27,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:47:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094954094] [2025-01-10 00:47:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:27,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:27,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:27,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:27,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-10 00:47:27,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:27,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:27,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-10 00:47:27,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:27,141 INFO L124 PetriNetUnfolderBase]: 126/274 cut-off events. [2025-01-10 00:47:27,141 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2025-01-10 00:47:27,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 274 events. 126/274 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1035 event pairs, 28 based on Foata normal form. 18/284 useless extension candidates. Maximal degree in co-relation 894. Up to 117 conditions per place. [2025-01-10 00:47:27,143 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 31 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-01-10 00:47:27,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 290 flow [2025-01-10 00:47:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:47:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:47:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-01-10 00:47:27,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-01-10 00:47:27,144 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 169 flow. Second operand 5 states and 90 transitions. [2025-01-10 00:47:27,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 290 flow [2025-01-10 00:47:27,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 226 flow, removed 23 selfloop flow, removed 8 redundant places. [2025-01-10 00:47:27,145 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 142 flow [2025-01-10 00:47:27,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2025-01-10 00:47:27,147 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2025-01-10 00:47:27,147 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 142 flow [2025-01-10 00:47:27,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:27,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:27,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:27,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:47:27,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -838954024, now seen corresponding path program 1 times [2025-01-10 00:47:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736870107] [2025-01-10 00:47:27,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:27,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:47:27,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:47:27,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:27,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:27,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:27,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736870107] [2025-01-10 00:47:27,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736870107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:27,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:27,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237997827] [2025-01-10 00:47:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:27,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:27,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:27,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:27,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:27,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-10 00:47:27,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:27,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:27,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-10 00:47:27,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:27,457 INFO L124 PetriNetUnfolderBase]: 141/358 cut-off events. [2025-01-10 00:47:27,458 INFO L125 PetriNetUnfolderBase]: For 322/360 co-relation queries the response was YES. [2025-01-10 00:47:27,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 358 events. 141/358 cut-off events. For 322/360 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1735 event pairs, 35 based on Foata normal form. 10/341 useless extension candidates. Maximal degree in co-relation 922. Up to 142 conditions per place. [2025-01-10 00:47:27,460 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 21 selfloop transitions, 1 changer transitions 21/55 dead transitions. [2025-01-10 00:47:27,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 294 flow [2025-01-10 00:47:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:47:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:47:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2025-01-10 00:47:27,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2025-01-10 00:47:27,461 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 142 flow. Second operand 6 states and 104 transitions. [2025-01-10 00:47:27,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 294 flow [2025-01-10 00:47:27,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 285 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:27,463 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 134 flow [2025-01-10 00:47:27,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2025-01-10 00:47:27,464 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-01-10 00:47:27,465 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 134 flow [2025-01-10 00:47:27,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:27,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:27,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:27,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:47:27,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:27,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash -73551806, now seen corresponding path program 2 times [2025-01-10 00:47:27,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:27,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981975716] [2025-01-10 00:47:27,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:47:27,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:27,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:47:27,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:47:27,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:47:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981975716] [2025-01-10 00:47:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981975716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:28,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:28,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:47:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125410876] [2025-01-10 00:47:28,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:28,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:47:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:28,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:47:28,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:47:28,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-01-10 00:47:28,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 31 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:28,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:28,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-01-10 00:47:28,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:28,246 INFO L124 PetriNetUnfolderBase]: 89/253 cut-off events. [2025-01-10 00:47:28,248 INFO L125 PetriNetUnfolderBase]: For 150/170 co-relation queries the response was YES. [2025-01-10 00:47:28,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 253 events. 89/253 cut-off events. For 150/170 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1114 event pairs, 31 based on Foata normal form. 7/242 useless extension candidates. Maximal degree in co-relation 656. Up to 87 conditions per place. [2025-01-10 00:47:28,250 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 17 selfloop transitions, 4 changer transitions 11/45 dead transitions. [2025-01-10 00:47:28,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 242 flow [2025-01-10 00:47:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:47:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:47:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2025-01-10 00:47:28,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2025-01-10 00:47:28,252 INFO L175 Difference]: Start difference. First operand has 53 places, 31 transitions, 134 flow. Second operand 7 states and 115 transitions. [2025-01-10 00:47:28,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 242 flow [2025-01-10 00:47:28,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 229 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-10 00:47:28,253 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 146 flow [2025-01-10 00:47:28,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2025-01-10 00:47:28,254 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-01-10 00:47:28,255 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 146 flow [2025-01-10 00:47:28,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:28,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:28,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:28,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:47:28,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:28,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:28,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2024233998, now seen corresponding path program 3 times [2025-01-10 00:47:28,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:28,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061694254] [2025-01-10 00:47:28,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:47:28,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:28,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:47:28,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:47:28,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:47:28,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:47:28,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:47:28,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:47:28,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:47:28,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:28,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:47:28,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:47:28,356 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:47:28,357 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-01-10 00:47:28,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:47:28,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:47:28,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 00:47:28,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-10 00:47:28,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:47:28,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:47:28,360 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2025-01-10 00:47:28,390 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:47:28,390 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:47:28,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:47:28 BasicIcfg [2025-01-10 00:47:28,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:47:28,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:47:28,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:47:28,394 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:47:28,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:22" (3/4) ... [2025-01-10 00:47:28,395 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:47:28,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:47:28,396 INFO L158 Benchmark]: Toolchain (without parser) took 6482.42ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 109.2MB in the beginning and 172.5MB in the end (delta: -63.3MB). Peak memory consumption was 147.6MB. Max. memory is 16.1GB. [2025-01-10 00:47:28,396 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:28,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.87ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 86.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:47:28,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.93ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 83.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:28,397 INFO L158 Benchmark]: Boogie Preprocessor took 59.50ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:28,397 INFO L158 Benchmark]: RCFGBuilder took 591.94ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 106.8MB in the end (delta: -25.9MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-01-10 00:47:28,398 INFO L158 Benchmark]: TraceAbstraction took 5391.63ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 106.0MB in the beginning and 172.6MB in the end (delta: -66.5MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. [2025-01-10 00:47:28,398 INFO L158 Benchmark]: Witness Printer took 2.27ms. Allocated memory is still 352.3MB. Free memory was 172.6MB in the beginning and 172.5MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:28,399 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.33ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.87ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 86.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.93ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 83.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.50ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 591.94ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 106.8MB in the end (delta: -25.9MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5391.63ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 106.0MB in the beginning and 172.6MB in the end (delta: -66.5MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. * Witness Printer took 2.27ms. Allocated memory is still 352.3MB. Free memory was 172.6MB in the beginning and 172.5MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L823] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - 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: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 6 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: 5.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 25 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=5, 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.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-01-10 00:47:28,415 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/mix054_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 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:47:30,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:47:30,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:47:30,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:47:30,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:47:30,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:47:30,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:47:30,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:47:30,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:47:30,542 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:47:30,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:47:30,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:47:30,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:47:30,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:47:30,542 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:47:30,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:47:30,542 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:47:30,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:47:30,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:47:30,543 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:47:30,544 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:47:30,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:47:30,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:47:30,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:30,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:30,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:30,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:30,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:47:30,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:30,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:30,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:30,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:30,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:47:30,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:47:30,546 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:47:30,546 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:47:30,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:47:30,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:47:30,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:47:30,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:47:30,546 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2025-01-10 00:47:30,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:47:30,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:47:30,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:47:30,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:47:30,818 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:47:30,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:32,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/522eb188e/311ed890588c4ba7bad5e40fbe81340f/FLAG3c470b636 [2025-01-10 00:47:32,317 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:47:32,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:32,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/522eb188e/311ed890588c4ba7bad5e40fbe81340f/FLAG3c470b636 [2025-01-10 00:47:32,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/522eb188e/311ed890588c4ba7bad5e40fbe81340f [2025-01-10 00:47:32,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:47:32,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:47:32,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:32,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:47:32,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:47:32,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35334fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32, skipping insertion in model container [2025-01-10 00:47:32,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:47:32,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:32,606 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:47:32,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:32,702 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:47:32,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32 WrapperNode [2025-01-10 00:47:32,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:32,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:32,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:47:32,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:47:32,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,761 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2025-01-10 00:47:32,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:32,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:47:32,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:47:32,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:47:32,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,787 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 00:47:32,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:47:32,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:47:32,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:47:32,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:47:32,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (1/1) ... [2025-01-10 00:47:32,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:32,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:32,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:47:32,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:47:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:47:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:47:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:47:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:47:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:47:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:47:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:47:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:47:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:47:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:47:32,855 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:47:32,956 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:47:32,957 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:47:33,195 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:47:33,195 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:47:33,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:47:33,344 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:47:33,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:33 BoogieIcfgContainer [2025-01-10 00:47:33,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:47:33,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:47:33,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:47:33,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:47:33,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:47:32" (1/3) ... [2025-01-10 00:47:33,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193a504f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:33, skipping insertion in model container [2025-01-10 00:47:33,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:32" (2/3) ... [2025-01-10 00:47:33,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193a504f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:33, skipping insertion in model container [2025-01-10 00:47:33,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:33" (3/3) ... [2025-01-10 00:47:33,352 INFO L128 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:33,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:47:33,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:47:33,367 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:47:33,413 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:47:33,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2025-01-10 00:47:33,480 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-01-10 00:47:33,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:33,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-01-10 00:47:33,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2025-01-10 00:47:33,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-01-10 00:47:33,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:47:33,501 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;@3b376e94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:47:33,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:47:33,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:47:33,504 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 00:47:33,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:33,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:33,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:47:33,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:33,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1632520084, now seen corresponding path program 1 times [2025-01-10 00:47:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819631500] [2025-01-10 00:47:33,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:33,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:33,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:33,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:47:33,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:47:33,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:47:33,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:47:33,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:33,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:33,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:47:33,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:33,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:33,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:33,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819631500] [2025-01-10 00:47:33,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819631500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:33,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:33,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:33,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140227214] [2025-01-10 00:47:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:33,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:33,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:33,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:33,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-01-10 00:47:33,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:33,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:33,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-01-10 00:47:33,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:33,777 INFO L124 PetriNetUnfolderBase]: 146/337 cut-off events. [2025-01-10 00:47:33,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:33,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 337 events. 146/337 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1789 event pairs, 20 based on Foata normal form. 24/355 useless extension candidates. Maximal degree in co-relation 600. Up to 208 conditions per place. [2025-01-10 00:47:33,784 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2025-01-10 00:47:33,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2025-01-10 00:47:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-01-10 00:47:33,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-01-10 00:47:33,794 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 74 transitions. [2025-01-10 00:47:33,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2025-01-10 00:47:33,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:33,799 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-01-10 00:47:33,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-01-10 00:47:33,805 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-01-10 00:47:33,805 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-01-10 00:47:33,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:33,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:33,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:33,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:47:34,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:34,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:34,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1341572772, now seen corresponding path program 1 times [2025-01-10 00:47:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:34,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272629043] [2025-01-10 00:47:34,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:34,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:34,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:47:34,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:47:34,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:47:34,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:47:34,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:34,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:34,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:47:34,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:34,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:34,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:34,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272629043] [2025-01-10 00:47:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272629043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:34,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:34,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:34,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738142194] [2025-01-10 00:47:34,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:34,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:34,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:34,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:34,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 00:47:34,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:34,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:34,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 00:47:34,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:34,203 INFO L124 PetriNetUnfolderBase]: 129/293 cut-off events. [2025-01-10 00:47:34,203 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-10 00:47:34,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 293 events. 129/293 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1594 event pairs, 129 based on Foata normal form. 12/293 useless extension candidates. Maximal degree in co-relation 551. Up to 232 conditions per place. [2025-01-10 00:47:34,205 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 14 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-01-10 00:47:34,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 94 flow [2025-01-10 00:47:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-01-10 00:47:34,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-10 00:47:34,206 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 56 transitions. [2025-01-10 00:47:34,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 94 flow [2025-01-10 00:47:34,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:34,207 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2025-01-10 00:47:34,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-01-10 00:47:34,208 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-01-10 00:47:34,208 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2025-01-10 00:47:34,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:34,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:34,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:34,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:47:34,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:34,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:34,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:34,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1341571400, now seen corresponding path program 1 times [2025-01-10 00:47:34,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:34,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2062394428] [2025-01-10 00:47:34,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:34,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:34,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:34,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:47:34,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:47:34,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:47:34,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:47:34,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:34,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:34,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:47:34,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:34,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:34,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062394428] [2025-01-10 00:47:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062394428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:34,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:34,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:47:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593718771] [2025-01-10 00:47:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:34,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:47:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:34,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:47:34,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:47:34,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-10 00:47:34,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:34,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:34,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-10 00:47:34,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:34,589 INFO L124 PetriNetUnfolderBase]: 180/382 cut-off events. [2025-01-10 00:47:34,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:34,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 382 events. 180/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1832 event pairs, 24 based on Foata normal form. 20/396 useless extension candidates. Maximal degree in co-relation 723. Up to 199 conditions per place. [2025-01-10 00:47:34,592 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 29 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2025-01-10 00:47:34,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 160 flow [2025-01-10 00:47:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:47:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:47:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-01-10 00:47:34,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 00:47:34,595 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 4 states and 80 transitions. [2025-01-10 00:47:34,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 160 flow [2025-01-10 00:47:34,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:47:34,596 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 83 flow [2025-01-10 00:47:34,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-01-10 00:47:34,597 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-01-10 00:47:34,597 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 83 flow [2025-01-10 00:47:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:34,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:34,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:34,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:47:34,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:34,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:34,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1603347063, now seen corresponding path program 1 times [2025-01-10 00:47:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:34,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290819182] [2025-01-10 00:47:34,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:34,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:34,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:47:34,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:47:34,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:47:34,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:47:34,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:34,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:34,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:47:34,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:34,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:34,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290819182] [2025-01-10 00:47:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290819182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:34,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:34,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:47:34,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112636739] [2025-01-10 00:47:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:34,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:34,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:34,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:34,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-10 00:47:34,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:34,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:34,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-10 00:47:34,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:35,002 INFO L124 PetriNetUnfolderBase]: 88/194 cut-off events. [2025-01-10 00:47:35,002 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-01-10 00:47:35,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 194 events. 88/194 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 656 event pairs, 16 based on Foata normal form. 14/202 useless extension candidates. Maximal degree in co-relation 449. Up to 71 conditions per place. [2025-01-10 00:47:35,004 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 25 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2025-01-10 00:47:35,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 176 flow [2025-01-10 00:47:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:47:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:47:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-01-10 00:47:35,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2025-01-10 00:47:35,005 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 83 flow. Second operand 5 states and 89 transitions. [2025-01-10 00:47:35,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 176 flow [2025-01-10 00:47:35,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 167 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:35,007 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 99 flow [2025-01-10 00:47:35,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2025-01-10 00:47:35,007 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2025-01-10 00:47:35,007 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 99 flow [2025-01-10 00:47:35,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:35,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:35,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:35,014 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-01-10 00:47:35,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:35,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:35,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1129752294, now seen corresponding path program 1 times [2025-01-10 00:47:35,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:35,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178714735] [2025-01-10 00:47:35,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:35,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:35,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:35,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:47:35,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:47:35,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:47:35,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:47:35,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:35,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:35,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:47:35,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:35,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:35,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:35,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178714735] [2025-01-10 00:47:35,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178714735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:35,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:35,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:47:35,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788617055] [2025-01-10 00:47:35,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:35,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:47:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:35,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:47:35,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:47:35,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-10 00:47:35,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 99 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:35,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:35,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-10 00:47:35,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:35,905 INFO L124 PetriNetUnfolderBase]: 153/328 cut-off events. [2025-01-10 00:47:35,905 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-10 00:47:35,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 328 events. 153/328 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1203 event pairs, 35 based on Foata normal form. 4/331 useless extension candidates. Maximal degree in co-relation 798. Up to 139 conditions per place. [2025-01-10 00:47:35,907 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 31 selfloop transitions, 5 changer transitions 24/66 dead transitions. [2025-01-10 00:47:35,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 339 flow [2025-01-10 00:47:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:47:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:47:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2025-01-10 00:47:35,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2025-01-10 00:47:35,909 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 99 flow. Second operand 9 states and 142 transitions. [2025-01-10 00:47:35,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 339 flow [2025-01-10 00:47:35,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 282 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-01-10 00:47:35,911 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 105 flow [2025-01-10 00:47:35,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=105, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2025-01-10 00:47:35,912 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-01-10 00:47:35,912 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 105 flow [2025-01-10 00:47:35,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:35,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:35,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:35,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:47:36,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:36,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:36,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1736565952, now seen corresponding path program 2 times [2025-01-10 00:47:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:36,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945574533] [2025-01-10 00:47:36,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:47:36,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:36,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:36,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:47:36,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:47:36,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:47:36,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:47:36,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:47:36,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:36,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 00:47:36,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:47:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:36,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:47:36,381 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:47:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945574533] [2025-01-10 00:47:36,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945574533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:36,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:47:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092763683] [2025-01-10 00:47:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:36,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:47:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:47:36,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:47:36,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:47:36,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-01-10 00:47:36,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 105 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:36,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:36,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-01-10 00:47:36,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:36,534 INFO L124 PetriNetUnfolderBase]: 105/253 cut-off events. [2025-01-10 00:47:36,535 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2025-01-10 00:47:36,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 253 events. 105/253 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 958 event pairs, 27 based on Foata normal form. 4/243 useless extension candidates. Maximal degree in co-relation 554. Up to 94 conditions per place. [2025-01-10 00:47:36,536 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 20 selfloop transitions, 3 changer transitions 15/49 dead transitions. [2025-01-10 00:47:36,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 224 flow [2025-01-10 00:47:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:47:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:47:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-01-10 00:47:36,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2025-01-10 00:47:36,537 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 105 flow. Second operand 7 states and 121 transitions. [2025-01-10 00:47:36,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 224 flow [2025-01-10 00:47:36,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 202 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 00:47:36,539 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 96 flow [2025-01-10 00:47:36,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2025-01-10 00:47:36,539 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-01-10 00:47:36,539 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 96 flow [2025-01-10 00:47:36,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:47:36,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:36,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:36,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:47:36,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:36,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:47:36,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:36,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1557008848, now seen corresponding path program 3 times [2025-01-10 00:47:36,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:47:36,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053037040] [2025-01-10 00:47:36,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:47:36,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:36,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:36,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:47:36,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:47:36,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:47:36,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:47:36,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:47:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:47:36,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:47:36,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:47:36,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:47:36,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:36,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:47:36,934 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:47:36,934 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:47:36,934 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-01-10 00:47:36,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:47:36,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:47:36,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 00:47:36,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-10 00:47:36,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:47:36,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:47:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:47:37,137 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-01-10 00:47:37,191 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:47:37,191 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:47:37,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:47:37 BasicIcfg [2025-01-10 00:47:37,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:47:37,201 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:47:37,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:47:37,201 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:47:37,202 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:33" (3/4) ... [2025-01-10 00:47:37,203 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:47:37,204 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:47:37,204 INFO L158 Benchmark]: Toolchain (without parser) took 4857.15ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 89.8MB in the beginning and 36.6MB in the end (delta: 53.1MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2025-01-10 00:47:37,205 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 83.9MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:37,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.83ms. Allocated memory is still 117.4MB. Free memory was 89.4MB in the beginning and 67.1MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:47:37,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.77ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:37,207 INFO L158 Benchmark]: Boogie Preprocessor took 40.85ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 62.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:37,207 INFO L158 Benchmark]: RCFGBuilder took 539.82ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 49.9MB in the end (delta: 12.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-01-10 00:47:37,207 INFO L158 Benchmark]: TraceAbstraction took 3854.25ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 49.3MB in the beginning and 37.9MB in the end (delta: 11.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2025-01-10 00:47:37,208 INFO L158 Benchmark]: Witness Printer took 2.41ms. Allocated memory is still 142.6MB. Free memory was 37.9MB in the beginning and 36.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:47:37,209 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.60ms. Allocated memory is still 83.9MB. Free memory was 54.2MB in the beginning and 54.2MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.83ms. Allocated memory is still 117.4MB. Free memory was 89.4MB in the beginning and 67.1MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.77ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.85ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 62.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 539.82ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 49.9MB in the end (delta: 12.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3854.25ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 49.3MB in the beginning and 37.9MB in the end (delta: 11.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Witness Printer took 2.41ms. Allocated memory is still 142.6MB. Free memory was 37.9MB in the beginning and 36.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L823] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - 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: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 6 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: 3.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 484 IncrementalHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 6 mSDtfsCounter, 484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 428 SizeOfPredicates, 15 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-01-10 00:47:37,233 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