./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:21:44,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:21:44,722 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:44,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:21:44,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:21:44,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:21:44,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:21:44,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:21:44,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:21:44,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:21:44,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:21:44,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:21:44,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:21:44,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:21:44,751 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:21:44,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:21:44,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:21:44,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:21:44,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:21:44,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:21:44,752 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:21:44,752 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:21:44,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:21:44,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:44,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:21:44,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:21:44,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:21:44,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:21:44,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:21:44,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:21:44,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:21:44,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:21:44,754 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2025-02-08 08:21:44,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:21:44,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:21:44,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:21:44,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:21:44,995 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:21:44,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:21:46,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44a613dd3/b9cc074467ff45999a7a0604532d8144/FLAGbe9b5451c [2025-02-08 08:21:46,478 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:21:46,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:21:46,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44a613dd3/b9cc074467ff45999a7a0604532d8144/FLAGbe9b5451c [2025-02-08 08:21:46,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44a613dd3/b9cc074467ff45999a7a0604532d8144 [2025-02-08 08:21:46,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:21:46,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:21:46,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:46,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:21:46,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:21:46,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:46" (1/1) ... [2025-02-08 08:21:46,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135baa24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:46, skipping insertion in model container [2025-02-08 08:21:46,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:46" (1/1) ... [2025-02-08 08:21:46,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:21:47,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:47,089 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:21:47,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:47,157 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:21:47,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:47 WrapperNode [2025-02-08 08:21:47,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:47,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:47,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:21:47,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:21:47,163 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:47" (1/1) ... [2025-02-08 08:21:47,172 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:47" (1/1) ... [2025-02-08 08:21:47,185 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 115 [2025-02-08 08:21:47,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:47,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:21:47,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:21:47,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:21:47,191 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:47" (1/1) ... [2025-02-08 08:21:47,191 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:47" (1/1) ... [2025-02-08 08:21:47,193 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:47" (1/1) ... [2025-02-08 08:21:47,202 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:47,202 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:47" (1/1) ... [2025-02-08 08:21:47,202 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:47" (1/1) ... [2025-02-08 08:21:47,207 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:47" (1/1) ... [2025-02-08 08:21:47,207 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:47" (1/1) ... [2025-02-08 08:21:47,208 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:47" (1/1) ... [2025-02-08 08:21:47,209 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:47" (1/1) ... [2025-02-08 08:21:47,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:21:47,211 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:21:47,211 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:21:47,211 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:21:47,212 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:47" (1/1) ... [2025-02-08 08:21:47,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:47,235 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:47,241 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:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:21:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:21:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:21:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:21:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:21:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:21:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:21:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:21:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:21:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:21:47,259 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:47,355 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:21:47,356 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:21:47,530 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:21:47,531 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:21:47,707 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:21:47,708 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:21:47,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:47 BoogieIcfgContainer [2025-02-08 08:21:47,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:21:47,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:21:47,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:21:47,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:21:47,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:21:46" (1/3) ... [2025-02-08 08:21:47,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a24f56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:47, skipping insertion in model container [2025-02-08 08:21:47,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:47" (2/3) ... [2025-02-08 08:21:47,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a24f56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:47, skipping insertion in model container [2025-02-08 08:21:47,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:47" (3/3) ... [2025-02-08 08:21:47,715 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:21:47,724 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:21:47,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 37 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:21:47,726 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:21:47,757 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:21:47,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 84 flow [2025-02-08 08:21:47,795 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2025-02-08 08:21:47,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:47,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-02-08 08:21:47,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 84 flow [2025-02-08 08:21:47,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 78 flow [2025-02-08 08:21:47,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:21:47,811 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;@25f9e9d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:21:47,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:21:47,814 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:21:47,815 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 08:21:47,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:47,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:47,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:21:47,815 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:47,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1293503405, now seen corresponding path program 1 times [2025-02-08 08:21:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318252803] [2025-02-08 08:21:47,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:47,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:21:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:21:47,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:48,087 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:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318252803] [2025-02-08 08:21:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318252803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659217156] [2025-02-08 08:21:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:48,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:48,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:48,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:48,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:21:48,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 78 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:48,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:48,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:21:48,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:48,360 INFO L124 PetriNetUnfolderBase]: 927/1533 cut-off events. [2025-02-08 08:21:48,361 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:21:48,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 1533 events. 927/1533 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7443 event pairs, 66 based on Foata normal form. 112/1644 useless extension candidates. Maximal degree in co-relation 3045. Up to 1352 conditions per place. [2025-02-08 08:21:48,373 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 37 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2025-02-08 08:21:48,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 182 flow [2025-02-08 08:21:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-02-08 08:21:48,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2025-02-08 08:21:48,383 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 78 flow. Second operand 3 states and 70 transitions. [2025-02-08 08:21:48,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 182 flow [2025-02-08 08:21:48,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:48,387 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2025-02-08 08:21:48,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-02-08 08:21:48,391 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-02-08 08:21:48,392 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2025-02-08 08:21:48,392 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:48,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:48,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:48,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:21:48,392 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:48,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -410673344, now seen corresponding path program 1 times [2025-02-08 08:21:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260627738] [2025-02-08 08:21:48,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:48,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:48,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:48,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:48,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:48,489 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:48,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:48,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260627738] [2025-02-08 08:21:48,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260627738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:48,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:48,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:48,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524585201] [2025-02-08 08:21:48,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:48,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:48,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:48,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:48,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-08 08:21:48,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 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:48,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:48,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-08 08:21:48,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:48,657 INFO L124 PetriNetUnfolderBase]: 830/1492 cut-off events. [2025-02-08 08:21:48,657 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 08:21:48,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 1492 events. 830/1492 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7704 event pairs, 830 based on Foata normal form. 56/1540 useless extension candidates. Maximal degree in co-relation 2914. Up to 1349 conditions per place. [2025-02-08 08:21:48,666 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 23 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2025-02-08 08:21:48,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 118 flow [2025-02-08 08:21:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-02-08 08:21:48,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2025-02-08 08:21:48,669 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 3 states and 47 transitions. [2025-02-08 08:21:48,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 118 flow [2025-02-08 08:21:48,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:48,671 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2025-02-08 08:21:48,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-02-08 08:21:48,671 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2025-02-08 08:21:48,672 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2025-02-08 08:21:48,672 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:48,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:48,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:48,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:21:48,672 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:48,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash -410671832, now seen corresponding path program 1 times [2025-02-08 08:21:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:48,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639774805] [2025-02-08 08:21:48,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:48,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:48,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:48,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:48,925 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:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639774805] [2025-02-08 08:21:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639774805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:48,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:48,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:48,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431056429] [2025-02-08 08:21:48,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:48,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:48,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:48,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:48,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-08 08:21:48,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:48,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:48,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-08 08:21:48,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:49,320 INFO L124 PetriNetUnfolderBase]: 1051/1840 cut-off events. [2025-02-08 08:21:49,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:49,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1840 events. 1051/1840 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9783 event pairs, 427 based on Foata normal form. 0/1785 useless extension candidates. Maximal degree in co-relation 3584. Up to 1162 conditions per place. [2025-02-08 08:21:49,327 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 30 selfloop transitions, 3 changer transitions 51/88 dead transitions. [2025-02-08 08:21:49,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 88 transitions, 352 flow [2025-02-08 08:21:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:21:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:21:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2025-02-08 08:21:49,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46710526315789475 [2025-02-08 08:21:49,329 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 8 states and 142 transitions. [2025-02-08 08:21:49,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 88 transitions, 352 flow [2025-02-08 08:21:49,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:21:49,333 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 96 flow [2025-02-08 08:21:49,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=96, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2025-02-08 08:21:49,334 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2025-02-08 08:21:49,334 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 96 flow [2025-02-08 08:21:49,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:49,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:49,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:49,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:21:49,334 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:49,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:49,335 INFO L85 PathProgramCache]: Analyzing trace with hash 750789657, now seen corresponding path program 1 times [2025-02-08 08:21:49,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:49,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029631422] [2025-02-08 08:21:49,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:49,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:49,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:21:49,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:21:49,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:49,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:49,591 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,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:49,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029631422] [2025-02-08 08:21:49,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029631422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:49,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:49,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:21:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267133707] [2025-02-08 08:21:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:49,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:21:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:49,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:21:49,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:21:49,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-08 08:21:49,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:49,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:49,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-08 08:21:49,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:49,971 INFO L124 PetriNetUnfolderBase]: 960/1654 cut-off events. [2025-02-08 08:21:49,971 INFO L125 PetriNetUnfolderBase]: For 771/771 co-relation queries the response was YES. [2025-02-08 08:21:49,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 1654 events. 960/1654 cut-off events. For 771/771 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7967 event pairs, 248 based on Foata normal form. 78/1731 useless extension candidates. Maximal degree in co-relation 3887. Up to 513 conditions per place. [2025-02-08 08:21:49,979 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 37 selfloop transitions, 4 changer transitions 66/111 dead transitions. [2025-02-08 08:21:49,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 111 transitions, 530 flow [2025-02-08 08:21:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:21:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:21:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2025-02-08 08:21:49,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46842105263157896 [2025-02-08 08:21:49,981 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 96 flow. Second operand 10 states and 178 transitions. [2025-02-08 08:21:49,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 111 transitions, 530 flow [2025-02-08 08:21:49,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 111 transitions, 499 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-02-08 08:21:49,991 INFO L231 Difference]: Finished difference. Result has 55 places, 32 transitions, 134 flow [2025-02-08 08:21:49,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=134, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2025-02-08 08:21:49,993 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-02-08 08:21:49,993 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 32 transitions, 134 flow [2025-02-08 08:21:49,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:49,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:49,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:21:49,993 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:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1426513077, now seen corresponding path program 1 times [2025-02-08 08:21:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942422425] [2025-02-08 08:21:49,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:50,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:21:50,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:21:50,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:50,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:50,141 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:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:50,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942422425] [2025-02-08 08:21:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942422425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:50,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:21:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558218161] [2025-02-08 08:21:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:21:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:50,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:21:50,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:21:50,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:21:50,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 32 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:50,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:50,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:21:50,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:50,306 INFO L124 PetriNetUnfolderBase]: 539/1003 cut-off events. [2025-02-08 08:21:50,306 INFO L125 PetriNetUnfolderBase]: For 734/734 co-relation queries the response was YES. [2025-02-08 08:21:50,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2545 conditions, 1003 events. 539/1003 cut-off events. For 734/734 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4679 event pairs, 148 based on Foata normal form. 80/1082 useless extension candidates. Maximal degree in co-relation 2526. Up to 418 conditions per place. [2025-02-08 08:21:50,311 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 43 selfloop transitions, 4 changer transitions 11/62 dead transitions. [2025-02-08 08:21:50,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 360 flow [2025-02-08 08:21:50,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:21:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:21:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-02-08 08:21:50,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5657894736842105 [2025-02-08 08:21:50,314 INFO L175 Difference]: Start difference. First operand has 55 places, 32 transitions, 134 flow. Second operand 4 states and 86 transitions. [2025-02-08 08:21:50,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 360 flow [2025-02-08 08:21:50,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 313 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-02-08 08:21:50,318 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 131 flow [2025-02-08 08:21:50,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2025-02-08 08:21:50,319 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2025-02-08 08:21:50,319 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 131 flow [2025-02-08 08:21:50,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:50,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:50,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:50,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:21:50,319 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:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1302233392, now seen corresponding path program 1 times [2025-02-08 08:21:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139966126] [2025-02-08 08:21:50,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:50,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:21:50,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:21:50,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:50,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:50,502 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:50,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:50,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139966126] [2025-02-08 08:21:50,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139966126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:50,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:50,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:50,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98590003] [2025-02-08 08:21:50,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:50,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:50,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:50,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:50,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:50,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:21:50,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:50,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:50,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:21:50,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:50,622 INFO L124 PetriNetUnfolderBase]: 290/554 cut-off events. [2025-02-08 08:21:50,623 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-02-08 08:21:50,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 554 events. 290/554 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2173 event pairs, 98 based on Foata normal form. 42/595 useless extension candidates. Maximal degree in co-relation 1469. Up to 239 conditions per place. [2025-02-08 08:21:50,625 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 36 selfloop transitions, 6 changer transitions 7/53 dead transitions. [2025-02-08 08:21:50,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 287 flow [2025-02-08 08:21:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:21:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:21:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-02-08 08:21:50,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2025-02-08 08:21:50,626 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 131 flow. Second operand 5 states and 86 transitions. [2025-02-08 08:21:50,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 287 flow [2025-02-08 08:21:50,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 259 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-08 08:21:50,628 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 133 flow [2025-02-08 08:21:50,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2025-02-08 08:21:50,628 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2025-02-08 08:21:50,628 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 133 flow [2025-02-08 08:21:50,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:50,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:50,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:50,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:21:50,629 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:50,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash -745791404, now seen corresponding path program 1 times [2025-02-08 08:21:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146604166] [2025-02-08 08:21:50,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:50,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:21:50,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:21:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:50,820 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:50,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146604166] [2025-02-08 08:21:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146604166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:50,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:50,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:21:50,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701544412] [2025-02-08 08:21:50,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:50,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:50,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:50,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:50,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-08 08:21:50,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:50,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:50,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-08 08:21:50,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:50,959 INFO L124 PetriNetUnfolderBase]: 387/745 cut-off events. [2025-02-08 08:21:50,959 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-02-08 08:21:50,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 745 events. 387/745 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3203 event pairs, 203 based on Foata normal form. 4/748 useless extension candidates. Maximal degree in co-relation 1957. Up to 421 conditions per place. [2025-02-08 08:21:50,962 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 31 selfloop transitions, 3 changer transitions 19/57 dead transitions. [2025-02-08 08:21:50,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 327 flow [2025-02-08 08:21:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:21:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:21:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-02-08 08:21:50,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4263157894736842 [2025-02-08 08:21:50,963 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 133 flow. Second operand 5 states and 81 transitions. [2025-02-08 08:21:50,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 327 flow [2025-02-08 08:21:50,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 274 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-08 08:21:50,965 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 112 flow [2025-02-08 08:21:50,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2025-02-08 08:21:50,965 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2025-02-08 08:21:50,965 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 112 flow [2025-02-08 08:21:50,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:50,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:50,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:50,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:21:50,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:50,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:50,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1708415324, now seen corresponding path program 2 times [2025-02-08 08:21:50,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:50,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472123152] [2025-02-08 08:21:50,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:21:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:50,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:21:50,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:21:50,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:50,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:51,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:51,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472123152] [2025-02-08 08:21:51,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472123152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:51,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:51,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:21:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110454052] [2025-02-08 08:21:51,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:51,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:21:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:51,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:21:51,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:21:51,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-08 08:21:51,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 112 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:51,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:51,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-08 08:21:51,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:51,716 INFO L124 PetriNetUnfolderBase]: 233/462 cut-off events. [2025-02-08 08:21:51,716 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-02-08 08:21:51,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 462 events. 233/462 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1752 event pairs, 48 based on Foata normal form. 4/466 useless extension candidates. Maximal degree in co-relation 1082. Up to 203 conditions per place. [2025-02-08 08:21:51,718 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 31 selfloop transitions, 4 changer transitions 23/62 dead transitions. [2025-02-08 08:21:51,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 314 flow [2025-02-08 08:21:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:21:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:21:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2025-02-08 08:21:51,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3362573099415205 [2025-02-08 08:21:51,721 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 112 flow. Second operand 9 states and 115 transitions. [2025-02-08 08:21:51,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 314 flow [2025-02-08 08:21:51,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 290 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 08:21:51,722 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 114 flow [2025-02-08 08:21:51,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=114, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2025-02-08 08:21:51,723 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-02-08 08:21:51,723 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 114 flow [2025-02-08 08:21:51,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:51,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:51,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:21:51,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:51,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash -10518914, now seen corresponding path program 3 times [2025-02-08 08:21:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147988742] [2025-02-08 08:21:51,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:21:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:51,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:21:51,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:21:51,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:21:51,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:21:51,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:51,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147988742] [2025-02-08 08:21:51,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147988742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:51,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:51,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:21:51,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723241358] [2025-02-08 08:21:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:21:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:51,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:21:51,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:21:51,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-08 08:21:51,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:51,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:51,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-08 08:21:51,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:52,143 INFO L124 PetriNetUnfolderBase]: 305/614 cut-off events. [2025-02-08 08:21:52,144 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-02-08 08:21:52,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 614 events. 305/614 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2672 event pairs, 93 based on Foata normal form. 4/618 useless extension candidates. Maximal degree in co-relation 1476. Up to 246 conditions per place. [2025-02-08 08:21:52,146 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 27 selfloop transitions, 5 changer transitions 37/73 dead transitions. [2025-02-08 08:21:52,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 387 flow [2025-02-08 08:21:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:21:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:21:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2025-02-08 08:21:52,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2025-02-08 08:21:52,148 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 114 flow. Second operand 8 states and 118 transitions. [2025-02-08 08:21:52,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 387 flow [2025-02-08 08:21:52,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 359 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-02-08 08:21:52,151 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 128 flow [2025-02-08 08:21:52,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2025-02-08 08:21:52,152 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-02-08 08:21:52,153 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 128 flow [2025-02-08 08:21:52,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:52,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:52,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:52,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:21:52,154 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:52,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1806505930, now seen corresponding path program 4 times [2025-02-08 08:21:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:52,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736399092] [2025-02-08 08:21:52,158 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:21:52,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:52,166 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-08 08:21:52,189 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:21:52,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:21:52,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:52,349 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:52,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:21:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736399092] [2025-02-08 08:21:52,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736399092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:52,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:52,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:21:52,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596788150] [2025-02-08 08:21:52,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:52,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:21:52,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:21:52,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:21:52,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:21:52,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:21:52,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:52,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:52,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:21:52,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:52,539 INFO L124 PetriNetUnfolderBase]: 219/456 cut-off events. [2025-02-08 08:21:52,540 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-02-08 08:21:52,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 456 events. 219/456 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1802 event pairs, 87 based on Foata normal form. 4/460 useless extension candidates. Maximal degree in co-relation 1092. Up to 218 conditions per place. [2025-02-08 08:21:52,541 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 26 selfloop transitions, 1 changer transitions 25/56 dead transitions. [2025-02-08 08:21:52,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 298 flow [2025-02-08 08:21:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:21:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:21:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-02-08 08:21:52,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-02-08 08:21:52,543 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 128 flow. Second operand 6 states and 96 transitions. [2025-02-08 08:21:52,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 298 flow [2025-02-08 08:21:52,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 284 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 08:21:52,545 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 103 flow [2025-02-08 08:21:52,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2025-02-08 08:21:52,546 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-02-08 08:21:52,549 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 103 flow [2025-02-08 08:21:52,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:21:52,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:52,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:52,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:21:52,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:21:52,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1391872204, now seen corresponding path program 5 times [2025-02-08 08:21:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:21:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542326941] [2025-02-08 08:21:52,550 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:21:52,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:21:52,561 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:21:52,594 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:21:52,596 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:21:52,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:21:52,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:21:52,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:21:52,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:21:52,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:52,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:21:52,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:21:52,667 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:21:52,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-08 08:21:52,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:21:52,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:21:52,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 08:21:52,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-08 08:21:52,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:21:52,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:21:52,670 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:52,732 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:21:52,733 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:21:52,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:21:52 BasicIcfg [2025-02-08 08:21:52,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:21:52,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:21:52,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:21:52,740 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:21:52,741 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:47" (3/4) ... [2025-02-08 08:21:52,742 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:21:52,744 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:21:52,744 INFO L158 Benchmark]: Toolchain (without parser) took 5953.10ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 112.9MB in the beginning and 202.6MB in the end (delta: -89.8MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2025-02-08 08:21:52,745 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:52,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.78ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 90.0MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:21:52,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.92ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:52,745 INFO L158 Benchmark]: Boogie Preprocessor took 24.75ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:21:52,746 INFO L158 Benchmark]: IcfgBuilder took 497.21ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 107.2MB in the end (delta: -21.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-02-08 08:21:52,746 INFO L158 Benchmark]: TraceAbstraction took 5029.90ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.4MB in the beginning and 202.7MB in the end (delta: -96.3MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2025-02-08 08:21:52,746 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 343.9MB. Free memory was 202.7MB in the beginning and 202.6MB in the end (delta: 57.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:21:52,747 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.78ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 90.0MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.92ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.75ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 497.21ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 107.2MB in the end (delta: -21.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5029.90ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.4MB in the beginning and 202.7MB in the end (delta: -96.3MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 343.9MB. Free memory was 202.7MB in the beginning and 202.6MB in the end (delta: 57.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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, 57 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.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1283 IncrementalHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 5 mSDtfsCounter, 1283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=4, InterpolantAutomatonStates: 61, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:21:52,765 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:21:54,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:21:54,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:21:54,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:21:54,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:21:54,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:21:54,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:21:54,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:21:54,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:21:54,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:21:54,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:21:54,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:21:54,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:21:54,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:21:54,948 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:21:54,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:21:54,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:21:54,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:21:54,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:21:54,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:21:54,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:54,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:21:54,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:21:54,950 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:21:54,950 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:21:54,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:21:54,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:21:54,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:21:54,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:21:54,950 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2025-02-08 08:21:55,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:21:55,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:21:55,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:21:55,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:21:55,177 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:21:55,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:21:56,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19c9673ac/f29c8539ccce46159821527f531c1eaa/FLAG9846d0f9b [2025-02-08 08:21:56,770 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:21:56,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:21:56,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19c9673ac/f29c8539ccce46159821527f531c1eaa/FLAG9846d0f9b [2025-02-08 08:21:56,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19c9673ac/f29c8539ccce46159821527f531c1eaa [2025-02-08 08:21:56,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:21:56,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:21:56,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:56,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:21:56,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:21:56,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:56" (1/1) ... [2025-02-08 08:21:56,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c295f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:56, skipping insertion in model container [2025-02-08 08:21:56,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:21:56" (1/1) ... [2025-02-08 08:21:56,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:21:57,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:57,154 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:21:57,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:21:57,232 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:21:57,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57 WrapperNode [2025-02-08 08:21:57,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:21:57,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:57,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:21:57,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:21:57,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,267 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 116 [2025-02-08 08:21:57,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:21:57,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:21:57,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:21:57,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:21:57,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,285 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:21:57,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:21:57,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:21:57,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:21:57,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:21:57,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (1/1) ... [2025-02-08 08:21:57,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:21:57,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:57,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:21:57,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:21:57,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:21:57,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:21:57,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:21:57,346 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:21:57,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:21:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:21:57,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:21:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:21:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:21:57,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:21:57,348 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:57,464 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:21:57,465 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:21:57,734 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:21:57,734 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:21:57,901 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:21:57,901 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:21:57,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:57 BoogieIcfgContainer [2025-02-08 08:21:57,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:21:57,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:21:57,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:21:57,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:21:57,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:21:56" (1/3) ... [2025-02-08 08:21:57,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71733b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:57, skipping insertion in model container [2025-02-08 08:21:57,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:21:57" (2/3) ... [2025-02-08 08:21:57,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71733b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:21:57, skipping insertion in model container [2025-02-08 08:21:57,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:21:57" (3/3) ... [2025-02-08 08:21:57,909 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:21:57,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:21:57,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 37 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:21:57,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:21:57,970 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:21:57,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 84 flow [2025-02-08 08:21:58,021 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2025-02-08 08:21:58,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:58,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-02-08 08:21:58,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 84 flow [2025-02-08 08:21:58,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 78 flow [2025-02-08 08:21:58,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:21:58,074 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;@5d9e017a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:21:58,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:21:58,081 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:21:58,082 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 08:21:58,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:58,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:58,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:21:58,084 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:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1352670317, now seen corresponding path program 1 times [2025-02-08 08:21:58,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:58,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153662267] [2025-02-08 08:21:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:58,101 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:58,102 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:58,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:21:58,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:21:58,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:58,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:58,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:21:58,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:58,219 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,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:58,221 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:58,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153662267] [2025-02-08 08:21:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153662267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:58,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:58,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516554870] [2025-02-08 08:21:58,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:58,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:58,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:58,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:58,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:58,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:21:58,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 78 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:58,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:58,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:21:58,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:58,547 INFO L124 PetriNetUnfolderBase]: 927/1533 cut-off events. [2025-02-08 08:21:58,547 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:21:58,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 1533 events. 927/1533 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7443 event pairs, 66 based on Foata normal form. 112/1644 useless extension candidates. Maximal degree in co-relation 3045. Up to 1352 conditions per place. [2025-02-08 08:21:58,559 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 37 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2025-02-08 08:21:58,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 182 flow [2025-02-08 08:21:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-02-08 08:21:58,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2025-02-08 08:21:58,572 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 78 flow. Second operand 3 states and 70 transitions. [2025-02-08 08:21:58,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 182 flow [2025-02-08 08:21:58,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:58,579 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2025-02-08 08:21:58,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-02-08 08:21:58,584 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-02-08 08:21:58,584 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2025-02-08 08:21:58,585 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:58,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:58,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:58,593 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:58,786 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:58,787 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:58,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1273609666, now seen corresponding path program 1 times [2025-02-08 08:21:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354509293] [2025-02-08 08:21:58,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:58,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:58,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:58,792 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:58,794 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:58,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:58,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:58,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:58,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:58,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:21:58,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:58,904 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,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:58,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354509293] [2025-02-08 08:21:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354509293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:21:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145749550] [2025-02-08 08:21:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:58,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:21:58,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:58,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:21:58,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:21:58,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-08 08:21:58,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 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:58,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:58,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-08 08:21:58,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:59,087 INFO L124 PetriNetUnfolderBase]: 830/1492 cut-off events. [2025-02-08 08:21:59,088 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 08:21:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 1492 events. 830/1492 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7704 event pairs, 830 based on Foata normal form. 56/1540 useless extension candidates. Maximal degree in co-relation 2914. Up to 1349 conditions per place. [2025-02-08 08:21:59,096 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 23 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2025-02-08 08:21:59,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 118 flow [2025-02-08 08:21:59,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:21:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:21:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-02-08 08:21:59,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2025-02-08 08:21:59,098 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 3 states and 47 transitions. [2025-02-08 08:21:59,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 118 flow [2025-02-08 08:21:59,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:21:59,100 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2025-02-08 08:21:59,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-02-08 08:21:59,101 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2025-02-08 08:21:59,101 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2025-02-08 08:21:59,102 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:59,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:59,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:59,111 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:59,306 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:59,307 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:59,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1273611178, now seen corresponding path program 1 times [2025-02-08 08:21:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516891829] [2025-02-08 08:21:59,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:59,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:59,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:59,310 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:59,311 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:59,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:21:59,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:21:59,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:59,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:59,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:21:59,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:59,407 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,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:59,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:59,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516891829] [2025-02-08 08:21:59,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516891829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:59,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:59,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:21:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9221489] [2025-02-08 08:21:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:21:59,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:59,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:21:59,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:21:59,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:21:59,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 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:59,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:59,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:21:59,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:21:59,577 INFO L124 PetriNetUnfolderBase]: 444/864 cut-off events. [2025-02-08 08:21:59,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:21:59,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 864 events. 444/864 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4011 event pairs, 132 based on Foata normal form. 56/919 useless extension candidates. Maximal degree in co-relation 1661. Up to 379 conditions per place. [2025-02-08 08:21:59,581 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 47 selfloop transitions, 4 changer transitions 1/57 dead transitions. [2025-02-08 08:21:59,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 226 flow [2025-02-08 08:21:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:21:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:21:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-02-08 08:21:59,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5657894736842105 [2025-02-08 08:21:59,582 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 4 states and 86 transitions. [2025-02-08 08:21:59,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 226 flow [2025-02-08 08:21:59,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:21:59,584 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 89 flow [2025-02-08 08:21:59,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-02-08 08:21:59,585 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-02-08 08:21:59,585 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 89 flow [2025-02-08 08:21:59,585 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:59,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:21:59,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:21:59,593 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:59,789 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:59,789 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:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:21:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash 506781483, now seen corresponding path program 1 times [2025-02-08 08:21:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:21:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767392693] [2025-02-08 08:21:59,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:21:59,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:21:59,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:21:59,795 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:59,797 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:59,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:21:59,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:21:59,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:21:59,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:21:59,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:21:59,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:21:59,956 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,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:21:59,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:21:59,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767392693] [2025-02-08 08:21:59,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767392693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:21:59,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:21:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:21:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184581349] [2025-02-08 08:21:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:21:59,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:21:59,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:21:59,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:21:59,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:21:59,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:21:59,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:21:59,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:21:59,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:00,123 INFO L124 PetriNetUnfolderBase]: 208/400 cut-off events. [2025-02-08 08:22:00,124 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-08 08:22:00,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 400 events. 208/400 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1358 event pairs, 88 based on Foata normal form. 26/425 useless extension candidates. Maximal degree in co-relation 919. Up to 161 conditions per place. [2025-02-08 08:22:00,125 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 37 selfloop transitions, 6 changer transitions 1/49 dead transitions. [2025-02-08 08:22:00,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 218 flow [2025-02-08 08:22:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:22:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:22:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-02-08 08:22:00,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2025-02-08 08:22:00,126 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 89 flow. Second operand 5 states and 86 transitions. [2025-02-08 08:22:00,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 218 flow [2025-02-08 08:22:00,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 209 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:22:00,128 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 105 flow [2025-02-08 08:22:00,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2025-02-08 08:22:00,128 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-02-08 08:22:00,128 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 105 flow [2025-02-08 08:22:00,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:00,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:00,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:22:00,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:00,329 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:22:00,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash -691435680, now seen corresponding path program 1 times [2025-02-08 08:22:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:00,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644972443] [2025-02-08 08:22:00,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:22:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:00,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:00,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:22:00,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:22:00,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:22:00,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:22:00,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:00,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:00,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:22:00,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:00,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:00,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:00,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644972443] [2025-02-08 08:22:00,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644972443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:00,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:00,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:22:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510157537] [2025-02-08 08:22:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:00,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:22:00,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:00,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:22:00,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:22:00,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:22:00,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 105 flow. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:00,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:22:00,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:01,111 INFO L124 PetriNetUnfolderBase]: 319/629 cut-off events. [2025-02-08 08:22:01,112 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-02-08 08:22:01,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 629 events. 319/629 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2567 event pairs, 75 based on Foata normal form. 8/636 useless extension candidates. Maximal degree in co-relation 1489. Up to 169 conditions per place. [2025-02-08 08:22:01,114 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 34 selfloop transitions, 7 changer transitions 48/94 dead transitions. [2025-02-08 08:22:01,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 461 flow [2025-02-08 08:22:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:22:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:22:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2025-02-08 08:22:01,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4100877192982456 [2025-02-08 08:22:01,115 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 105 flow. Second operand 12 states and 187 transitions. [2025-02-08 08:22:01,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 461 flow [2025-02-08 08:22:01,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 395 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-02-08 08:22:01,118 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 117 flow [2025-02-08 08:22:01,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=117, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2025-02-08 08:22:01,118 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2025-02-08 08:22:01,118 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 117 flow [2025-02-08 08:22:01,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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:01,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:01,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:01,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:22:01,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:01,319 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:22:01,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1175122354, now seen corresponding path program 2 times [2025-02-08 08:22:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:01,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369611421] [2025-02-08 08:22:01,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:22:01,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:01,322 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:22:01,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:22:01,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:22:01,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:22:01,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:22:01,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:01,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:22:01,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:01,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:01,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:01,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369611421] [2025-02-08 08:22:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369611421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:22:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50717405] [2025-02-08 08:22:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:01,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:22:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:01,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:22:01,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:22:01,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:22:01,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 117 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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:01,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:01,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:22:01,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:01,898 INFO L124 PetriNetUnfolderBase]: 169/346 cut-off events. [2025-02-08 08:22:01,898 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-02-08 08:22:01,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 346 events. 169/346 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1147 event pairs, 36 based on Foata normal form. 4/350 useless extension candidates. Maximal degree in co-relation 822. Up to 109 conditions per place. [2025-02-08 08:22:01,900 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 29 selfloop transitions, 4 changer transitions 26/64 dead transitions. [2025-02-08 08:22:01,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 330 flow [2025-02-08 08:22:01,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:22:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:22:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2025-02-08 08:22:01,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3526315789473684 [2025-02-08 08:22:01,901 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 117 flow. Second operand 10 states and 134 transitions. [2025-02-08 08:22:01,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 330 flow [2025-02-08 08:22:01,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 282 flow, removed 16 selfloop flow, removed 10 redundant places. [2025-02-08 08:22:01,903 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 101 flow [2025-02-08 08:22:01,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=101, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2025-02-08 08:22:01,903 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-02-08 08:22:01,903 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 101 flow [2025-02-08 08:22:01,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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:01,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:01,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:01,910 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:02,104 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:02,104 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:02,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1141428316, now seen corresponding path program 3 times [2025-02-08 08:22:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:02,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818158179] [2025-02-08 08:22:02,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:22:02,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:02,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:02,108 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:02,109 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:02,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:22:02,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:22:02,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:22:02,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:22:02,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:22:02,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:22:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:22:02,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:22:02,419 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:22:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818158179] [2025-02-08 08:22:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818158179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:22:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:22:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:22:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046474802] [2025-02-08 08:22:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:22:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:22:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:22:02,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:22:02,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:22:02,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2025-02-08 08:22:02,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 31 transitions, 101 flow. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 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:02,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:22:02,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2025-02-08 08:22:02,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:22:02,764 INFO L124 PetriNetUnfolderBase]: 181/378 cut-off events. [2025-02-08 08:22:02,764 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-08 08:22:02,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 378 events. 181/378 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1336 event pairs, 35 based on Foata normal form. 4/382 useless extension candidates. Maximal degree in co-relation 874. Up to 137 conditions per place. [2025-02-08 08:22:02,767 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 29 selfloop transitions, 4 changer transitions 32/70 dead transitions. [2025-02-08 08:22:02,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 341 flow [2025-02-08 08:22:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:22:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:22:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2025-02-08 08:22:02,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38421052631578945 [2025-02-08 08:22:02,768 INFO L175 Difference]: Start difference. First operand has 54 places, 31 transitions, 101 flow. Second operand 10 states and 146 transitions. [2025-02-08 08:22:02,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 341 flow [2025-02-08 08:22:02,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 309 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-02-08 08:22:02,770 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 110 flow [2025-02-08 08:22:02,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2025-02-08 08:22:02,772 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-02-08 08:22:02,772 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 110 flow [2025-02-08 08:22:02,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 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:02,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:22:02,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:22:02,779 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:02,973 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:02,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:22:02,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:22:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1614095756, now seen corresponding path program 4 times [2025-02-08 08:22:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:22:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443023669] [2025-02-08 08:22:02,975 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:22:02,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:02,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:22:02,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:22:02,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:22:03,031 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-08 08:22:03,046 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:22:03,046 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:22:03,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:22:03,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:22:03,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:22:03,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:22:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:22:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:22:03,103 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:22:03,104 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:22:03,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-08 08:22:03,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:22:03,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:22:03,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 08:22:03,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-08 08:22:03,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-08 08:22:03,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:22:03,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:22:03,306 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-02-08 08:22:03,339 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:22:03,339 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:22:03,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:22:03 BasicIcfg [2025-02-08 08:22:03,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:22:03,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:22:03,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:22:03,343 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:22:03,344 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:57" (3/4) ... [2025-02-08 08:22:03,345 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:22:03,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:22:03,345 INFO L158 Benchmark]: Toolchain (without parser) took 6524.28ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.0MB in the beginning and 51.9MB in the end (delta: 39.1MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2025-02-08 08:22:03,346 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 35.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:03,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.47ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.2MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:22:03,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.37ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:03,346 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:03,346 INFO L158 Benchmark]: IcfgBuilder took 604.99ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 55.1MB in the end (delta: 7.9MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2025-02-08 08:22:03,346 INFO L158 Benchmark]: TraceAbstraction took 5439.68ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 55.1MB in the beginning and 51.9MB in the end (delta: 3.3MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-02-08 08:22:03,347 INFO L158 Benchmark]: Witness Printer took 2.05ms. Allocated memory is still 159.4MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 14.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:22:03,347 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.15ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 35.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.47ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.2MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.37ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 604.99ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 55.1MB in the end (delta: 7.9MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5439.68ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 55.1MB in the beginning and 51.9MB in the end (delta: 3.3MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 2.05ms. Allocated memory is still 159.4MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 14.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1633=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633=0, t1634=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=0, t1634=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=0, t1634=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=0, t1634=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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, 57 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1305 IncrementalHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 0 mSDtfsCounter, 1305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 546 SizeOfPredicates, 20 NumberOfNonLiveVariables, 603 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:03,363 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