./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:21:38,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:21:38,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:21:38,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:21:38,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:21:38,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:21:38,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:21:38,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:21:38,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:21:38,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:21:38,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:21:38,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:21:38,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:21:38,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:21:38,949 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:21:38,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:21:38,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:21:38,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:21:38,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:21:38,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:21:38,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:21:38,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:38,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:21:38,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:21:38,952 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 -> 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f [2025-02-08 08:21:39,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:21:39,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:21:39,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:21:39,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:21:39,291 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:21:39,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:40,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daf89ac1f/7406f07ec6ab4b6cb2469f6363396825/FLAGbf9521939 [2025-02-08 08:21:41,132 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:21:41,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:41,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daf89ac1f/7406f07ec6ab4b6cb2469f6363396825/FLAGbf9521939 [2025-02-08 08:21:41,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daf89ac1f/7406f07ec6ab4b6cb2469f6363396825 [2025-02-08 08:21:41,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:21:41,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:21:41,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:41,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:21:41,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:21:41,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d41fce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41, skipping insertion in model container [2025-02-08 08:21:41,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:21:41,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:41,606 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:21:41,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:41,729 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:21:41,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41 WrapperNode [2025-02-08 08:21:41,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:41,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:41,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:21:41,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:21:41,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,795 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2025-02-08 08:21:41,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:41,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:21:41,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:21:41,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:21:41,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,833 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:21:41,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:21:41,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:21:41,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:21:41,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:21:41,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (1/1) ... [2025-02-08 08:21:41,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:41,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:21:41,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:21:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:21:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:21:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:21:41,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:21:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:21:41,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:21:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:21:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:21:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:21:41,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:21:41,917 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:21:42,049 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:21:42,050 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:21:42,345 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:21:42,345 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:21:42,584 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:21:42,584 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:21:42,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:42 BoogieIcfgContainer [2025-02-08 08:21:42,585 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:21:42,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:21:42,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:21:42,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:21:42,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:21:41" (1/3) ... [2025-02-08 08:21:42,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7000a206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:42, skipping insertion in model container [2025-02-08 08:21:42,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:41" (2/3) ... [2025-02-08 08:21:42,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7000a206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:42, skipping insertion in model container [2025-02-08 08:21:42,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:42" (3/3) ... [2025-02-08 08:21:42,596 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:42,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:21:42,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:21:42,614 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:21:42,665 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:21:42,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2025-02-08 08:21:42,723 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2025-02-08 08:21:42,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:42,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-08 08:21:42,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2025-02-08 08:21:42,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2025-02-08 08:21:42,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:21:42,760 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;@34be082d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:21:42,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:21:42,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:21:42,766 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 08:21:42,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:42,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:42,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:21:42,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:42,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1468528509, now seen corresponding path program 1 times [2025-02-08 08:21:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27088550] [2025-02-08 08:21:42,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:42,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:21:42,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:21:42,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:43,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:43,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27088550] [2025-02-08 08:21:43,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27088550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:43,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141312411] [2025-02-08 08:21:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:43,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:43,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:43,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:43,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:43,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:43,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:43,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:43,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:43,708 INFO L124 PetriNetUnfolderBase]: 783/1303 cut-off events. [2025-02-08 08:21:43,709 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:21:43,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2597 conditions, 1303 events. 783/1303 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6200 event pairs, 55 based on Foata normal form. 96/1398 useless extension candidates. Maximal degree in co-relation 2587. Up to 1149 conditions per place. [2025-02-08 08:21:43,719 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2025-02-08 08:21:43,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 174 flow [2025-02-08 08:21:43,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-08 08:21:43,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-02-08 08:21:43,732 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 68 transitions. [2025-02-08 08:21:43,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 174 flow [2025-02-08 08:21:43,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:43,740 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2025-02-08 08:21:43,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-08 08:21:43,746 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-02-08 08:21:43,747 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2025-02-08 08:21:43,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:43,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:43,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:43,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:21:43,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:43,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1524450704, now seen corresponding path program 1 times [2025-02-08 08:21:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:43,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334466248] [2025-02-08 08:21:43,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:43,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:43,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:43,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:43,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:43,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:43,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334466248] [2025-02-08 08:21:43,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334466248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:43,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:43,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:43,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018319208] [2025-02-08 08:21:43,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:43,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:43,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:43,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:43,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:43,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:43,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:43,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:43,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:43,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:44,069 INFO L124 PetriNetUnfolderBase]: 701/1269 cut-off events. [2025-02-08 08:21:44,070 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-08 08:21:44,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 1269 events. 701/1269 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6404 event pairs, 701 based on Foata normal form. 48/1310 useless extension candidates. Maximal degree in co-relation 2477. Up to 1146 conditions per place. [2025-02-08 08:21:44,078 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 22 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2025-02-08 08:21:44,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 114 flow [2025-02-08 08:21:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-08 08:21:44,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4144144144144144 [2025-02-08 08:21:44,080 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 46 transitions. [2025-02-08 08:21:44,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 114 flow [2025-02-08 08:21:44,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:44,082 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2025-02-08 08:21:44,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-02-08 08:21:44,083 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-02-08 08:21:44,083 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2025-02-08 08:21:44,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:44,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:44,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:44,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:21:44,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:44,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1524450154, now seen corresponding path program 1 times [2025-02-08 08:21:44,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:44,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059367068] [2025-02-08 08:21:44,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:44,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:44,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:44,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:44,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:44,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:44,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059367068] [2025-02-08 08:21:44,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059367068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:44,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:44,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:21:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247731176] [2025-02-08 08:21:44,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:44,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:21:44,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:44,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:21:44,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:21:44,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:44,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:44,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:44,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:44,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:44,603 INFO L124 PetriNetUnfolderBase]: 389/765 cut-off events. [2025-02-08 08:21:44,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:44,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 765 events. 389/765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3534 event pairs, 103 based on Foata normal form. 48/812 useless extension candidates. Maximal degree in co-relation 1467. Up to 349 conditions per place. [2025-02-08 08:21:44,608 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 44 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2025-02-08 08:21:44,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 214 flow [2025-02-08 08:21:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:21:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:21:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-08 08:21:44,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-02-08 08:21:44,611 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 4 states and 83 transitions. [2025-02-08 08:21:44,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 214 flow [2025-02-08 08:21:44,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:21:44,613 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 87 flow [2025-02-08 08:21:44,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-02-08 08:21:44,614 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2025-02-08 08:21:44,614 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 87 flow [2025-02-08 08:21:44,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:44,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:44,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:44,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:21:44,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:44,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 683450527, now seen corresponding path program 1 times [2025-02-08 08:21:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221790807] [2025-02-08 08:21:44,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:44,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:21:44,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:21:44,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:44,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221790807] [2025-02-08 08:21:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221790807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162871058] [2025-02-08 08:21:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:44,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:44,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:44,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:44,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:44,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-02-08 08:21:44,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:44,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:44,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:45,141 INFO L124 PetriNetUnfolderBase]: 181/353 cut-off events. [2025-02-08 08:21:45,141 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-08 08:21:45,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 353 events. 181/353 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1188 event pairs, 69 based on Foata normal form. 24/376 useless extension candidates. Maximal degree in co-relation 815. Up to 146 conditions per place. [2025-02-08 08:21:45,144 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2025-02-08 08:21:45,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 210 flow [2025-02-08 08:21:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:21:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:21:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-02-08 08:21:45,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2025-02-08 08:21:45,147 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 87 flow. Second operand 5 states and 84 transitions. [2025-02-08 08:21:45,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 210 flow [2025-02-08 08:21:45,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:45,150 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow [2025-02-08 08:21:45,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-02-08 08:21:45,151 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2025-02-08 08:21:45,151 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow [2025-02-08 08:21:45,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-02-08 08:21:45,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:45,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:45,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:21:45,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:45,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1559839361, now seen corresponding path program 1 times [2025-02-08 08:21:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:45,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449683492] [2025-02-08 08:21:45,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:45,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:21:45,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:21:45,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:45,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:46,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449683492] [2025-02-08 08:21:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449683492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:46,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:46,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:21:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835515553] [2025-02-08 08:21:46,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:46,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:21:46,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:46,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:21:46,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:21:46,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:46,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:46,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:46,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:46,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:46,429 INFO L124 PetriNetUnfolderBase]: 213/424 cut-off events. [2025-02-08 08:21:46,429 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-02-08 08:21:46,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 424 events. 213/424 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1483 event pairs, 46 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 1026. Up to 234 conditions per place. [2025-02-08 08:21:46,431 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 27 selfloop transitions, 3 changer transitions 32/67 dead transitions. [2025-02-08 08:21:46,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 345 flow [2025-02-08 08:21:46,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:21:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:21:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2025-02-08 08:21:46,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155405405405405 [2025-02-08 08:21:46,434 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 8 states and 123 transitions. [2025-02-08 08:21:46,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 345 flow [2025-02-08 08:21:46,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 288 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-08 08:21:46,438 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 92 flow [2025-02-08 08:21:46,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=8, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2025-02-08 08:21:46,440 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-02-08 08:21:46,441 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 92 flow [2025-02-08 08:21:46,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:46,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:46,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:46,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:21:46,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:46,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1044992959, now seen corresponding path program 2 times [2025-02-08 08:21:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625435933] [2025-02-08 08:21:46,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:21:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:46,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:21:46,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:21:46,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:46,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625435933] [2025-02-08 08:21:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625435933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:49,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:49,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:21:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832972357] [2025-02-08 08:21:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:49,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:21:49,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:49,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:21:49,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:21:49,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:49,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 92 flow. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 10 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:49,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:49,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:49,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:49,701 INFO L124 PetriNetUnfolderBase]: 158/333 cut-off events. [2025-02-08 08:21:49,701 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-08 08:21:49,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 333 events. 158/333 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1119 event pairs, 20 based on Foata normal form. 4/337 useless extension candidates. Maximal degree in co-relation 748. Up to 126 conditions per place. [2025-02-08 08:21:49,705 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 27 selfloop transitions, 5 changer transitions 24/61 dead transitions. [2025-02-08 08:21:49,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 291 flow [2025-02-08 08:21:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:21:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:21:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2025-02-08 08:21:49,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35945945945945945 [2025-02-08 08:21:49,707 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 92 flow. Second operand 10 states and 133 transitions. [2025-02-08 08:21:49,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 291 flow [2025-02-08 08:21:49,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 273 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 08:21:49,711 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 98 flow [2025-02-08 08:21:49,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=98, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2025-02-08 08:21:49,711 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-02-08 08:21:49,712 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 98 flow [2025-02-08 08:21:49,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 10 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:49,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:49,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:49,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:21:49,713 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:49,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1907152801, now seen corresponding path program 3 times [2025-02-08 08:21:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99468804] [2025-02-08 08:21:49,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:21:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:49,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:21:49,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:21:49,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:21:49,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:21:49,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:21:49,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:21:49,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:21:49,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:49,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:21:49,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:21:49,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:21:49,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-08 08:21:49,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:21:49,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:21:49,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 08:21:49,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-08 08:21:49,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:21:49,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:21:49,836 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-02-08 08:21:49,895 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:21:49,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:21:49,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:21:49 BasicIcfg [2025-02-08 08:21:49,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:21:49,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:21:49,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:21:49,900 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:21:49,900 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:42" (3/4) ... [2025-02-08 08:21:49,902 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:21:49,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:21:49,903 INFO L158 Benchmark]: Toolchain (without parser) took 8727.02ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 110.0MB in the beginning and 131.9MB in the end (delta: -21.9MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2025-02-08 08:21:49,903 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:49,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.46ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 87.5MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:21:49,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.92ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 85.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:49,905 INFO L158 Benchmark]: Boogie Preprocessor took 50.49ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:49,905 INFO L158 Benchmark]: IcfgBuilder took 735.19ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 100.0MB in the end (delta: -17.9MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2025-02-08 08:21:49,905 INFO L158 Benchmark]: TraceAbstraction took 7311.78ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 99.3MB in the beginning and 131.9MB in the end (delta: -32.6MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2025-02-08 08:21:49,905 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 268.4MB. Free memory was 131.9MB in the beginning and 131.9MB in the end (delta: 35.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:49,907 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.46ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 87.5MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.92ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 85.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.49ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 735.19ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 100.0MB in the end (delta: -17.9MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7311.78ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 99.3MB in the beginning and 131.9MB in the end (delta: -32.6MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 268.4MB. Free memory was 131.9MB in the beginning and 131.9MB in the end (delta: 35.2kB). 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; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1603=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1603=-2, t1604=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L771] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L740] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-2, t1604=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-2, t1604=-1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-2, t1604=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L833] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=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: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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, 55 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: 7.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 607 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 0 mSDtfsCounter, 607 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-02-08 08:21:49,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:21:52,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:21:52,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:21:52,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:21:52,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:21:52,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:21:52,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:21:52,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:21:52,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:21:52,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:21:52,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:21:52,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:21:52,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:21:52,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:21:52,416 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:21:52,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:21:52,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:21:52,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:21:52,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:21:52,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:21:52,418 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:21:52,418 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:21:52,418 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:21:52,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:21:52,419 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:21:52,419 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:21:52,419 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:21:52,419 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:21:52,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:21:52,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:21:52,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:21:52,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:21:52,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:21:52,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:21:52,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:21:52,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:52,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:21:52,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:21:52,421 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:21:52,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:21:52,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:21:52,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:21:52,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:21:52,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:21:52,421 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 -> 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f [2025-02-08 08:21:52,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:21:52,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:21:52,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:21:52,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:21:52,778 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:21:52,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:54,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bdbae44/239b0300253e45b6b486269942b77561/FLAG56a40add4 [2025-02-08 08:21:54,446 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:21:54,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:54,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bdbae44/239b0300253e45b6b486269942b77561/FLAG56a40add4 [2025-02-08 08:21:54,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bdbae44/239b0300253e45b6b486269942b77561 [2025-02-08 08:21:54,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:21:54,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:21:54,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:54,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:21:54,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:21:54,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:54,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d619cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54, skipping insertion in model container [2025-02-08 08:21:54,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:54,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:21:54,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:54,872 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:21:54,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:54,977 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:21:54,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54 WrapperNode [2025-02-08 08:21:54,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:54,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:54,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:21:54,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:21:54,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,042 INFO L138 Inliner]: procedures = 175, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2025-02-08 08:21:55,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:55,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:21:55,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:21:55,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:21:55,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:21:55,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:21:55,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:21:55,100 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:21:55,100 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:21:55,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (1/1) ... [2025-02-08 08:21:55,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:55,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:21:55,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:21:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:21:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:21:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:21:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:21:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:21:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:21:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:21:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:21:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:21:55,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:21:55,165 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:21:55,297 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:21:55,299 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:21:55,636 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:21:55,636 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:21:55,907 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:21:55,908 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:21:55,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:55 BoogieIcfgContainer [2025-02-08 08:21:55,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:21:55,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:21:55,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:21:55,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:21:55,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:21:54" (1/3) ... [2025-02-08 08:21:55,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22aaf0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:55, skipping insertion in model container [2025-02-08 08:21:55,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:54" (2/3) ... [2025-02-08 08:21:55,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22aaf0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:55, skipping insertion in model container [2025-02-08 08:21:55,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:55" (3/3) ... [2025-02-08 08:21:55,918 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-08 08:21:55,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:21:55,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:21:55,932 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:21:55,995 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:21:56,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2025-02-08 08:21:56,064 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2025-02-08 08:21:56,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:56,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-08 08:21:56,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2025-02-08 08:21:56,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2025-02-08 08:21:56,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:21:56,096 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;@3afddd07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:21:56,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:21:56,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:21:56,103 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 08:21:56,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:56,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:56,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:21:56,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:56,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1527695421, now seen corresponding path program 1 times [2025-02-08 08:21:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:56,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398198238] [2025-02-08 08:21:56,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:56,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:56,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:56,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:21:56,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:21:56,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:21:56,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:21:56,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:56,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:56,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:21:56,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:56,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:56,269 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398198238] [2025-02-08 08:21:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398198238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:56,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002876630] [2025-02-08 08:21:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:56,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:56,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:56,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:56,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:56,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:56,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:56,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:56,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:56,654 INFO L124 PetriNetUnfolderBase]: 783/1303 cut-off events. [2025-02-08 08:21:56,655 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:21:56,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2597 conditions, 1303 events. 783/1303 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6200 event pairs, 55 based on Foata normal form. 96/1398 useless extension candidates. Maximal degree in co-relation 2587. Up to 1149 conditions per place. [2025-02-08 08:21:56,670 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2025-02-08 08:21:56,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 174 flow [2025-02-08 08:21:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-08 08:21:56,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-02-08 08:21:56,687 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 68 transitions. [2025-02-08 08:21:56,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 174 flow [2025-02-08 08:21:56,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:56,694 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2025-02-08 08:21:56,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-08 08:21:56,702 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-02-08 08:21:56,702 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2025-02-08 08:21:56,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:56,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:56,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:56,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:21:56,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:56,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:56,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:56,904 INFO L85 PathProgramCache]: Analyzing trace with hash 159832306, now seen corresponding path program 1 times [2025-02-08 08:21:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167953807] [2025-02-08 08:21:56,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:56,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:56,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:56,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:21:56,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:21:56,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:57,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:57,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:57,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:57,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:21:57,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:57,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:57,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:57,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167953807] [2025-02-08 08:21:57,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167953807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:57,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528706923] [2025-02-08 08:21:57,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:57,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:57,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:57,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-08 08:21:57,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:57,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:57,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-08 08:21:57,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:57,240 INFO L124 PetriNetUnfolderBase]: 701/1269 cut-off events. [2025-02-08 08:21:57,240 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-08 08:21:57,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 1269 events. 701/1269 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6395 event pairs, 701 based on Foata normal form. 48/1310 useless extension candidates. Maximal degree in co-relation 2477. Up to 1146 conditions per place. [2025-02-08 08:21:57,254 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 22 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2025-02-08 08:21:57,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 114 flow [2025-02-08 08:21:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-08 08:21:57,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4144144144144144 [2025-02-08 08:21:57,255 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 46 transitions. [2025-02-08 08:21:57,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 114 flow [2025-02-08 08:21:57,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:57,256 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2025-02-08 08:21:57,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-02-08 08:21:57,257 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-02-08 08:21:57,257 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2025-02-08 08:21:57,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:57,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:57,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:57,266 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-02-08 08:21:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:57,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash 159832856, now seen corresponding path program 1 times [2025-02-08 08:21:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888622727] [2025-02-08 08:21:57,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:57,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:21:57,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:21:57,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:57,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:57,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:57,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:57,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:21:57,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:57,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:57,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:57,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888622727] [2025-02-08 08:21:57,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888622727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:57,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:21:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354365822] [2025-02-08 08:21:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:57,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:21:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:57,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:21:57,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:21:57,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:57,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:57,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:57,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:57,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:57,790 INFO L124 PetriNetUnfolderBase]: 389/765 cut-off events. [2025-02-08 08:21:57,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:57,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 765 events. 389/765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3534 event pairs, 103 based on Foata normal form. 48/812 useless extension candidates. Maximal degree in co-relation 1467. Up to 349 conditions per place. [2025-02-08 08:21:57,796 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 44 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2025-02-08 08:21:57,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 214 flow [2025-02-08 08:21:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:21:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:21:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-08 08:21:57,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-02-08 08:21:57,800 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 4 states and 83 transitions. [2025-02-08 08:21:57,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 214 flow [2025-02-08 08:21:57,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:21:57,802 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 87 flow [2025-02-08 08:21:57,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-02-08 08:21:57,804 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2025-02-08 08:21:57,804 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 87 flow [2025-02-08 08:21:57,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:57,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:57,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:57,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:21:58,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:58,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:58,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash -231841057, now seen corresponding path program 1 times [2025-02-08 08:21:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180947028] [2025-02-08 08:21:58,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:58,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:58,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:58,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:21:58,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:21:58,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:21:58,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:21:58,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:58,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:58,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:21:58,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:58,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:58,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180947028] [2025-02-08 08:21:58,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180947028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:58,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:58,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:58,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274605085] [2025-02-08 08:21:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:58,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:58,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:58,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:58,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:58,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-02-08 08:21:58,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:58,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:58,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:58,318 INFO L124 PetriNetUnfolderBase]: 181/353 cut-off events. [2025-02-08 08:21:58,318 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-08 08:21:58,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 353 events. 181/353 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1188 event pairs, 69 based on Foata normal form. 24/376 useless extension candidates. Maximal degree in co-relation 815. Up to 146 conditions per place. [2025-02-08 08:21:58,320 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2025-02-08 08:21:58,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 210 flow [2025-02-08 08:21:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:21:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:21:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-02-08 08:21:58,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2025-02-08 08:21:58,322 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 87 flow. Second operand 5 states and 84 transitions. [2025-02-08 08:21:58,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 210 flow [2025-02-08 08:21:58,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:58,326 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow [2025-02-08 08:21:58,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-02-08 08:21:58,328 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2025-02-08 08:21:58,328 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow [2025-02-08 08:21:58,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-02-08 08:21:58,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:58,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:58,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:21:58,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:58,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:58,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:58,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1844102527, now seen corresponding path program 1 times [2025-02-08 08:21:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:58,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329954170] [2025-02-08 08:21:58,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:58,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:58,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:58,532 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:21:58,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:21:58,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:21:58,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:21:58,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:58,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:58,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:21:58,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:58,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:58,848 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:58,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329954170] [2025-02-08 08:21:58,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329954170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:58,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:58,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:21:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188471237] [2025-02-08 08:21:58,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:58,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:21:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:58,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:21:58,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:21:58,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:58,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:58,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:58,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:58,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:59,194 INFO L124 PetriNetUnfolderBase]: 213/424 cut-off events. [2025-02-08 08:21:59,194 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-02-08 08:21:59,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 424 events. 213/424 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1543 event pairs, 37 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 1026. Up to 169 conditions per place. [2025-02-08 08:21:59,197 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 39 selfloop transitions, 5 changer transitions 26/75 dead transitions. [2025-02-08 08:21:59,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 377 flow [2025-02-08 08:21:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:21:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:21:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2025-02-08 08:21:59,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4294294294294294 [2025-02-08 08:21:59,199 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 9 states and 143 transitions. [2025-02-08 08:21:59,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 377 flow [2025-02-08 08:21:59,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 320 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-08 08:21:59,203 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 109 flow [2025-02-08 08:21:59,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2025-02-08 08:21:59,204 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-02-08 08:21:59,204 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 109 flow [2025-02-08 08:21:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:59,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:59,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:59,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:21:59,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:59,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:59,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1346138915, now seen corresponding path program 2 times [2025-02-08 08:21:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:59,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509092166] [2025-02-08 08:21:59,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:21:59,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:59,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:59,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:21:59,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:21:59,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:21:59,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:21:59,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:59,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:59,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:21:59,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:59,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:59,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509092166] [2025-02-08 08:21:59,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509092166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:59,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:59,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:21:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430406951] [2025-02-08 08:21:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:21:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:59,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:21:59,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:21:59,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 08:21:59,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 109 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:59,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:59,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 08:21:59,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:00,109 INFO L124 PetriNetUnfolderBase]: 187/383 cut-off events. [2025-02-08 08:22:00,109 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-08 08:22:00,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 383 events. 187/383 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1370 event pairs, 53 based on Foata normal form. 4/386 useless extension candidates. Maximal degree in co-relation 925. Up to 168 conditions per place. [2025-02-08 08:22:00,113 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 32 selfloop transitions, 3 changer transitions 18/58 dead transitions. [2025-02-08 08:22:00,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 292 flow [2025-02-08 08:22:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:22:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:22:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-02-08 08:22:00,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015444015444015 [2025-02-08 08:22:00,114 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 109 flow. Second operand 7 states and 104 transitions. [2025-02-08 08:22:00,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 292 flow [2025-02-08 08:22:00,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 266 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-08 08:22:00,116 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 100 flow [2025-02-08 08:22:00,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=100, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2025-02-08 08:22:00,117 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-02-08 08:22:00,117 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 100 flow [2025-02-08 08:22:00,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:22:00,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:00,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:00,129 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-02-08 08:22:00,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:00,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:22:00,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash 691415375, now seen corresponding path program 3 times [2025-02-08 08:22:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:00,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524379135] [2025-02-08 08:22:00,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:22:00,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:00,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:00,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:22:00,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:22:00,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:22:00,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:22:00,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:22:00,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:22:00,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:22:00,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:22:00,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:22:00,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:00,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:22:00,498 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:22:00,500 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:22:00,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-08 08:22:00,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:22:00,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:22:00,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 08:22:00,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-08 08:22:00,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:22:00,512 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-02-08 08:22:00,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:00,704 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-02-08 08:22:00,776 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:22:00,776 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:22:00,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:22:00 BasicIcfg [2025-02-08 08:22:00,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:22:00,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:22:00,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:22:00,782 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:22:00,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:55" (3/4) ... [2025-02-08 08:22:00,787 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:22:00,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:22:00,789 INFO L158 Benchmark]: Toolchain (without parser) took 6299.08ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 46.1MB in the end (delta: 45.4MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2025-02-08 08:22:00,789 INFO L158 Benchmark]: CDTParser took 2.50ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:00,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.26ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 68.7MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:22:00,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.77ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:00,790 INFO L158 Benchmark]: Boogie Preprocessor took 53.92ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:00,790 INFO L158 Benchmark]: IcfgBuilder took 808.65ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 50.4MB in the end (delta: 13.1MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2025-02-08 08:22:00,791 INFO L158 Benchmark]: TraceAbstraction took 4870.88ms. Allocated memory is still 117.4MB. Free memory was 50.4MB in the beginning and 46.1MB in the end (delta: 4.3MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2025-02-08 08:22:00,791 INFO L158 Benchmark]: Witness Printer took 6.93ms. Allocated memory is still 117.4MB. Free memory was 46.1MB in the beginning and 46.1MB in the end (delta: 6.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:00,792 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.50ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.26ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 68.7MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.77ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.92ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 808.65ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 50.4MB in the end (delta: 13.1MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4870.88ms. Allocated memory is still 117.4MB. Free memory was 50.4MB in the beginning and 46.1MB in the end (delta: 4.3MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Witness Printer took 6.93ms. Allocated memory is still 117.4MB. Free memory was 46.1MB in the beginning and 46.1MB in the end (delta: 6.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1603=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1603=-1, t1604=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L771] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L740] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-1, t1604=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-1, t1604=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603=-1, t1604=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L833] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L17] 0 __assert_fail ("0", "rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=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: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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, 55 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: 4.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred 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, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 468 SizeOfPredicates, 15 NumberOfNonLiveVariables, 530 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-02-08 08:22:00,811 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