./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe025_power.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe025_power.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:57:12,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:57:12,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:57:12,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:57:12,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:57:12,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:57:12,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:57:12,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:57:12,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:57:12,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:57:12,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:57:12,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:57:12,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:57:12,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:57:12,797 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:57:12,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:57:12,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:57:12,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:57:12,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:57:12,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:57:12,798 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:57:12,798 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:57:12,798 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:57:12,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:57:12,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:57:12,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:57:12,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:57:12,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:57:12,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:57:12,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:57:12,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:57:12,802 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/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 -> 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6 [2025-03-04 09:57:13,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:57:13,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:57:13,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:57:13,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:57:13,057 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:57:13,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe025_power.i [2025-03-04 09:57:14,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dd2ad0e/467358c3d89044a387f1cc49695b4cd0/FLAG35863709a [2025-03-04 09:57:14,504 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:57:14,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe025_power.i [2025-03-04 09:57:14,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dd2ad0e/467358c3d89044a387f1cc49695b4cd0/FLAG35863709a [2025-03-04 09:57:14,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10dd2ad0e/467358c3d89044a387f1cc49695b4cd0 [2025-03-04 09:57:14,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:57:14,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:57:14,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:57:14,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:57:14,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:57:14,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:57:14" (1/1) ... [2025-03-04 09:57:14,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5deddda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:14, skipping insertion in model container [2025-03-04 09:57:14,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:57:14" (1/1) ... [2025-03-04 09:57:14,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:57:15,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:57:15,154 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:57:15,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:57:15,244 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:57:15,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15 WrapperNode [2025-03-04 09:57:15,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:57:15,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:57:15,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:57:15,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:57:15,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,293 INFO L138 Inliner]: procedures = 175, calls = 75, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 225 [2025-03-04 09:57:15,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:57:15,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:57:15,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:57:15,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:57:15,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,325 INFO L175 MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2025-03-04 09:57:15,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:57:15,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:57:15,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:57:15,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:57:15,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (1/1) ... [2025-03-04 09:57:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:57:15,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:57:15,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:57:15,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:57:15,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:57:15,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:57:15,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:57:15,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:57:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:57:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:57:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:57:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:57:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:57:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:57:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:57:15,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:57:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:57:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:57:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:57:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:57:15,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:57:15,412 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:57:15,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:57:15,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:57:16,054 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:57:16,055 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:57:16,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:57:16,698 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:57:16,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:57:16 BoogieIcfgContainer [2025-03-04 09:57:16,698 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:57:16,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:57:16,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:57:16,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:57:16,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:57:14" (1/3) ... [2025-03-04 09:57:16,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e71e21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:57:16, skipping insertion in model container [2025-03-04 09:57:16,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:15" (2/3) ... [2025-03-04 09:57:16,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e71e21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:57:16, skipping insertion in model container [2025-03-04 09:57:16,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:57:16" (3/3) ... [2025-03-04 09:57:16,708 INFO L128 eAbstractionObserver]: Analyzing ICFG safe025_power.i [2025-03-04 09:57:16,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:57:16,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe025_power.i that has 4 procedures, 99 locations, 1 initial locations, 0 loop locations, and 58 error locations. [2025-03-04 09:57:16,723 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:57:16,922 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:57:16,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 212 flow [2025-03-04 09:57:17,015 INFO L124 PetriNetUnfolderBase]: 2/97 cut-off events. [2025-03-04 09:57:17,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:57:17,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 442 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2025-03-04 09:57:17,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 212 flow [2025-03-04 09:57:17,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2025-03-04 09:57:17,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:57:17,045 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;@9cd4a17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:57:17,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2025-03-04 09:57:17,052 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:57:17,052 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 09:57:17,052 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:57:17,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:57:17,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:57:17,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2025-03-04 09:57:17,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:57:17,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1405552831, now seen corresponding path program 1 times [2025-03-04 09:57:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:57:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837175973] [2025-03-04 09:57:17,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:57:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:57:17,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:57:17,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:57:17,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:17,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:57:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:57:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:57:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837175973] [2025-03-04 09:57:17,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837175973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:57:17,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:57:17,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:57:17,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950077004] [2025-03-04 09:57:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:57:17,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:57:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:57:17,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:57:17,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:57:17,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 100 [2025-03-04 09:57:17,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:17,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:57:17,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 100 [2025-03-04 09:57:17,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:57:22,210 INFO L124 PetriNetUnfolderBase]: 28349/42224 cut-off events. [2025-03-04 09:57:22,210 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 09:57:22,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81733 conditions, 42224 events. 28349/42224 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 1794. Compared 305444 event pairs, 28349 based on Foata normal form. 1440/30702 useless extension candidates. Maximal degree in co-relation 81722. Up to 39326 conditions per place. [2025-03-04 09:57:22,535 INFO L140 encePairwiseOnDemand]: 54/100 looper letters, 43 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2025-03-04 09:57:22,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 199 flow [2025-03-04 09:57:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:57:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:57:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-04 09:57:22,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2025-03-04 09:57:22,564 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 203 flow. Second operand 3 states and 119 transitions. [2025-03-04 09:57:22,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 199 flow [2025-03-04 09:57:22,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:57:22,582 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 110 flow [2025-03-04 09:57:22,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-03-04 09:57:22,589 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -45 predicate places. [2025-03-04 09:57:22,589 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 110 flow [2025-03-04 09:57:22,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:22,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:57:22,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:57:22,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:57:22,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2025-03-04 09:57:22,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:57:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1405552830, now seen corresponding path program 1 times [2025-03-04 09:57:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:57:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950049322] [2025-03-04 09:57:22,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:57:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:57:22,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:57:22,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:57:22,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:22,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:57:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:57:22,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:57:22,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950049322] [2025-03-04 09:57:22,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950049322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:57:22,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:57:22,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:57:22,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658369840] [2025-03-04 09:57:22,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:57:22,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:57:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:57:22,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:57:22,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:57:22,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 100 [2025-03-04 09:57:22,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:22,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:57:22,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 100 [2025-03-04 09:57:22,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:57:24,665 INFO L124 PetriNetUnfolderBase]: 10215/15733 cut-off events. [2025-03-04 09:57:24,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:57:24,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30239 conditions, 15733 events. 10215/15733 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 103555 event pairs, 10215 based on Foata normal form. 0/14019 useless extension candidates. Maximal degree in co-relation 30233. Up to 14374 conditions per place. [2025-03-04 09:57:24,714 INFO L140 encePairwiseOnDemand]: 90/100 looper letters, 34 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2025-03-04 09:57:24,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 162 flow [2025-03-04 09:57:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:57:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:57:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-04 09:57:24,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24666666666666667 [2025-03-04 09:57:24,715 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 110 flow. Second operand 3 states and 74 transitions. [2025-03-04 09:57:24,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 162 flow [2025-03-04 09:57:24,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 42 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:57:24,716 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 93 flow [2025-03-04 09:57:24,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-03-04 09:57:24,717 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -53 predicate places. [2025-03-04 09:57:24,717 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 93 flow [2025-03-04 09:57:24,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:24,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:57:24,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:57:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:57:24,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2025-03-04 09:57:24,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:57:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1405553248, now seen corresponding path program 1 times [2025-03-04 09:57:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:57:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237988574] [2025-03-04 09:57:24,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:57:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:57:24,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:57:24,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:57:24,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:24,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:57:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:57:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:57:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237988574] [2025-03-04 09:57:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237988574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:57:24,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:57:24,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:57:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537947257] [2025-03-04 09:57:24,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:57:24,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:57:24,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:57:24,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:57:24,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:57:24,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 100 [2025-03-04 09:57:24,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:24,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:57:24,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 100 [2025-03-04 09:57:24,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:57:26,134 INFO L124 PetriNetUnfolderBase]: 8875/12691 cut-off events. [2025-03-04 09:57:26,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:57:26,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25326 conditions, 12691 events. 8875/12691 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 74792 event pairs, 835 based on Foata normal form. 0/11581 useless extension candidates. Maximal degree in co-relation 25319. Up to 11149 conditions per place. [2025-03-04 09:57:26,182 INFO L140 encePairwiseOnDemand]: 97/100 looper letters, 56 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-04 09:57:26,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 257 flow [2025-03-04 09:57:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:57:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:57:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 09:57:26,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2966666666666667 [2025-03-04 09:57:26,183 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 93 flow. Second operand 3 states and 89 transitions. [2025-03-04 09:57:26,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 257 flow [2025-03-04 09:57:26,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:57:26,184 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 94 flow [2025-03-04 09:57:26,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-03-04 09:57:26,185 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -53 predicate places. [2025-03-04 09:57:26,185 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 94 flow [2025-03-04 09:57:26,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:26,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:57:26,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:57:26,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:57:26,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2025-03-04 09:57:26,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:57:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash -622476589, now seen corresponding path program 1 times [2025-03-04 09:57:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:57:26,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477482661] [2025-03-04 09:57:26,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:57:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:57:26,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:57:26,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:57:26,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:26,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:57:26,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:57:26,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:57:26,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:57:26,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:26,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:57:26,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:57:26,244 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:57:26,245 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (98 of 99 remaining) [2025-03-04 09:57:26,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 99 remaining) [2025-03-04 09:57:26,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 99 remaining) [2025-03-04 09:57:26,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONMEMORY_LEAK (85 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (84 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 99 remaining) [2025-03-04 09:57:26,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 99 remaining) [2025-03-04 09:57:26,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (41 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (40 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 99 remaining) [2025-03-04 09:57:26,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONMEMORY_LEAK (24 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 99 remaining) [2025-03-04 09:57:26,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 99 remaining) [2025-03-04 09:57:26,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 99 remaining) [2025-03-04 09:57:26,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:57:26,255 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 09:57:26,285 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:57:26,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:57:26,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:57:26 BasicIcfg [2025-03-04 09:57:26,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:57:26,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:57:26,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:57:26,293 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:57:26,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:57:16" (3/4) ... [2025-03-04 09:57:26,294 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:57:26,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:57:26,296 INFO L158 Benchmark]: Toolchain (without parser) took 11532.58ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 121.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 963.8MB. Max. memory is 16.1GB. [2025-03-04 09:57:26,296 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:57:26,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.74ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 95.4MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:57:26,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.21ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 92.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:57:26,297 INFO L158 Benchmark]: Boogie Preprocessor took 54.17ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 87.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:57:26,298 INFO L158 Benchmark]: IcfgBuilder took 1345.84ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 88.4MB in the end (delta: -930.9kB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2025-03-04 09:57:26,298 INFO L158 Benchmark]: TraceAbstraction took 9590.86ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 88.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 921.3MB. Max. memory is 16.1GB. [2025-03-04 09:57:26,298 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 2.3GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 313.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:57:26,299 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.74ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 95.4MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.21ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 92.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.17ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 87.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1345.84ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 88.4MB in the end (delta: -930.9kB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9590.86ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 88.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 921.3MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 2.3GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 313.8kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L873] 0 pthread_t t2369; [L874] FCALL, FORK 0 pthread_create(&t2369, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-1, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L875] 0 pthread_t t2370; [L876] FCALL, FORK 0 pthread_create(&t2370, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-1, t2370=0, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L803] 2 x$w_buff1 = x$w_buff0 [L804] 2 x$w_buff0 = 2 [L805] 2 x$w_buff1_used = x$w_buff0_used [L806] 2 x$w_buff0_used = (_Bool)1 [L807] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 2 !expression [L19] CALL 2 reach_error() [L18] COND FALSE 2 !(0) [L18] 2 __assert_fail ("0", "safe025_power.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - 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: 878]: 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: 876]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 162 locations, 99 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: 9.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 0 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=0, InterpolantAutomatonStates: 9, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-03-04 09:57:26,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe025_power.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:57:28,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:57:28,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:57:28,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:57:28,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:57:28,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:57:28,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:57:28,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:57:28,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:57:28,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:57:28,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:57:28,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:57:28,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:57:28,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:57:28,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:57:28,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:57:28,791 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:57:28,792 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:57:28,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:57:28,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:57:28,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:57:28,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:57:28,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:57:28,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:57:28,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:57:28,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:57:28,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:57:28,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:57:28,793 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:57:28,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:57:28,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:57:28,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:57:28,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:57:28,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:57:28,793 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/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 -> 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6 [2025-03-04 09:57:29,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:57:29,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:57:29,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:57:29,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:57:29,049 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:57:29,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe025_power.i [2025-03-04 09:57:30,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbb40ba9/49c4df82c2ed4443aafaf5a39677ea96/FLAGe6e0d0160 [2025-03-04 09:57:30,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:57:30,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe025_power.i [2025-03-04 09:57:30,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbb40ba9/49c4df82c2ed4443aafaf5a39677ea96/FLAGe6e0d0160 [2025-03-04 09:57:30,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbb40ba9/49c4df82c2ed4443aafaf5a39677ea96 [2025-03-04 09:57:30,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:57:30,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:57:30,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:57:30,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:57:30,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:57:30,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:30,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5198b0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30, skipping insertion in model container [2025-03-04 09:57:30,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:30,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:57:30,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:57:30,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:57:30,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:57:30,975 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:57:30,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30 WrapperNode [2025-03-04 09:57:30,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:57:30,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:57:30,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:57:30,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:57:30,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,025 INFO L138 Inliner]: procedures = 179, calls = 75, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 226 [2025-03-04 09:57:31,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:57:31,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:57:31,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:57:31,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:57:31,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,066 INFO L175 MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2025-03-04 09:57:31,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:57:31,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:57:31,092 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:57:31,092 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:57:31,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (1/1) ... [2025-03-04 09:57:31,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:57:31,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:57:31,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:57:31,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:57:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:57:31,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:57:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:57:31,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:57:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:57:31,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:57:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:57:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:57:31,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:57:31,142 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:57:31,280 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:57:31,282 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:57:31,907 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:57:31,908 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:57:32,601 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:57:32,602 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:57:32,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:57:32 BoogieIcfgContainer [2025-03-04 09:57:32,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:57:32,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:57:32,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:57:32,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:57:32,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:57:30" (1/3) ... [2025-03-04 09:57:32,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b985c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:57:32, skipping insertion in model container [2025-03-04 09:57:32,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:57:30" (2/3) ... [2025-03-04 09:57:32,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b985c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:57:32, skipping insertion in model container [2025-03-04 09:57:32,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:57:32" (3/3) ... [2025-03-04 09:57:32,609 INFO L128 eAbstractionObserver]: Analyzing ICFG safe025_power.i [2025-03-04 09:57:32,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:57:32,621 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe025_power.i that has 4 procedures, 99 locations, 1 initial locations, 0 loop locations, and 58 error locations. [2025-03-04 09:57:32,621 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:57:32,772 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:57:32,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 212 flow [2025-03-04 09:57:32,859 INFO L124 PetriNetUnfolderBase]: 2/97 cut-off events. [2025-03-04 09:57:32,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:57:32,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 442 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2025-03-04 09:57:32,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 212 flow [2025-03-04 09:57:32,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2025-03-04 09:57:32,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:57:32,878 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;@7777dcaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:57:32,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2025-03-04 09:57:32,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:57:32,883 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 09:57:32,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:57:32,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:57:32,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:57:32,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2025-03-04 09:57:32,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:57:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1346385919, now seen corresponding path program 1 times [2025-03-04 09:57:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:57:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201796071] [2025-03-04 09:57:32,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:57:32,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:57:32,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:57:32,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:57:32,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:57:33,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:57:33,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:57:33,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:33,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:57:33,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:57:33,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:57:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:57:33,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:57:33,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:57:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201796071] [2025-03-04 09:57:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201796071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:57:33,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:57:33,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:57:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207345293] [2025-03-04 09:57:33,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:57:33,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:57:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:57:33,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:57:33,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:57:33,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 100 [2025-03-04 09:57:33,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:33,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:57:33,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 100 [2025-03-04 09:57:33,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:57:38,049 INFO L124 PetriNetUnfolderBase]: 28349/42224 cut-off events. [2025-03-04 09:57:38,049 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 09:57:38,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81733 conditions, 42224 events. 28349/42224 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 1794. Compared 305444 event pairs, 28349 based on Foata normal form. 1440/30702 useless extension candidates. Maximal degree in co-relation 81722. Up to 39326 conditions per place. [2025-03-04 09:57:38,279 INFO L140 encePairwiseOnDemand]: 54/100 looper letters, 43 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2025-03-04 09:57:38,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 199 flow [2025-03-04 09:57:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:57:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:57:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-04 09:57:38,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2025-03-04 09:57:38,295 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 203 flow. Second operand 3 states and 119 transitions. [2025-03-04 09:57:38,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 199 flow [2025-03-04 09:57:38,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 51 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:57:38,303 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 110 flow [2025-03-04 09:57:38,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-03-04 09:57:38,308 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -45 predicate places. [2025-03-04 09:57:38,309 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 110 flow [2025-03-04 09:57:38,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:38,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:57:38,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:57:38,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:57:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:57:38,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2025-03-04 09:57:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:57:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1346385918, now seen corresponding path program 1 times [2025-03-04 09:57:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:57:38,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559153437] [2025-03-04 09:57:38,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:57:38,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:57:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:57:38,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:57:38,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:57:38,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:57:38,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:57:38,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:38,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:57:38,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:57:38,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:57:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:57:38,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:57:38,714 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:57:38,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559153437] [2025-03-04 09:57:38,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559153437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:57:38,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:57:38,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:57:38,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581571028] [2025-03-04 09:57:38,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:57:38,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:57:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:57:38,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:57:38,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:57:38,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 100 [2025-03-04 09:57:38,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:38,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:57:38,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 100 [2025-03-04 09:57:38,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:57:40,791 INFO L124 PetriNetUnfolderBase]: 10215/15733 cut-off events. [2025-03-04 09:57:40,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:57:40,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30239 conditions, 15733 events. 10215/15733 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 103555 event pairs, 10215 based on Foata normal form. 0/14019 useless extension candidates. Maximal degree in co-relation 30233. Up to 14374 conditions per place. [2025-03-04 09:57:40,880 INFO L140 encePairwiseOnDemand]: 90/100 looper letters, 34 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2025-03-04 09:57:40,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 162 flow [2025-03-04 09:57:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:57:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:57:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-04 09:57:40,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24666666666666667 [2025-03-04 09:57:40,882 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 110 flow. Second operand 3 states and 74 transitions. [2025-03-04 09:57:40,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 162 flow [2025-03-04 09:57:40,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 42 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:57:40,883 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 93 flow [2025-03-04 09:57:40,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-03-04 09:57:40,883 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -53 predicate places. [2025-03-04 09:57:40,883 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 93 flow [2025-03-04 09:57:40,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:40,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:57:40,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:57:40,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:57:41,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:57:41,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2025-03-04 09:57:41,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:57:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1346386336, now seen corresponding path program 1 times [2025-03-04 09:57:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:57:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864199018] [2025-03-04 09:57:41,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:57:41,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:57:41,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:57:41,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:57:41,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:57:41,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:57:41,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:57:41,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:41,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:57:41,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:57:41,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:57:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:57:41,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:57:41,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:57:41,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864199018] [2025-03-04 09:57:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864199018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:57:41,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:57:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:57:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18860992] [2025-03-04 09:57:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:57:41,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:57:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:57:41,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:57:41,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:57:41,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 100 [2025-03-04 09:57:41,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:41,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:57:41,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 100 [2025-03-04 09:57:41,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:57:42,449 INFO L124 PetriNetUnfolderBase]: 8875/12691 cut-off events. [2025-03-04 09:57:42,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:57:42,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25326 conditions, 12691 events. 8875/12691 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 74792 event pairs, 835 based on Foata normal form. 0/11581 useless extension candidates. Maximal degree in co-relation 25319. Up to 11149 conditions per place. [2025-03-04 09:57:42,483 INFO L140 encePairwiseOnDemand]: 97/100 looper letters, 56 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-04 09:57:42,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 257 flow [2025-03-04 09:57:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:57:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:57:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 09:57:42,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2966666666666667 [2025-03-04 09:57:42,484 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 93 flow. Second operand 3 states and 89 transitions. [2025-03-04 09:57:42,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 257 flow [2025-03-04 09:57:42,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:57:42,485 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 94 flow [2025-03-04 09:57:42,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-03-04 09:57:42,486 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -53 predicate places. [2025-03-04 09:57:42,486 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 94 flow [2025-03-04 09:57:42,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-03-04 09:57:42,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:57:42,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:57:42,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:57:42,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:57:42,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2025-03-04 09:57:42,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:57:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1211697685, now seen corresponding path program 1 times [2025-03-04 09:57:42,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:57:42,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9290256] [2025-03-04 09:57:42,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:57:42,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:57:42,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:57:42,693 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:57:42,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:57:42,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:57:42,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:57:42,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:42,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:57:42,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:57:42,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:57:42,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:57:42,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:57:42,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:57:42,871 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 09:57:42,871 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:57:42,872 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (98 of 99 remaining) [2025-03-04 09:57:42,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONMEMORY_LEAK (85 of 99 remaining) [2025-03-04 09:57:42,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (84 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 99 remaining) [2025-03-04 09:57:42,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (41 of 99 remaining) [2025-03-04 09:57:42,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (40 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONMEMORY_LEAK (24 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 99 remaining) [2025-03-04 09:57:42,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 99 remaining) [2025-03-04 09:57:42,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 99 remaining) [2025-03-04 09:57:42,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 99 remaining) [2025-03-04 09:57:42,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 99 remaining) [2025-03-04 09:57:42,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 99 remaining) [2025-03-04 09:57:42,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 99 remaining) [2025-03-04 09:57:42,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 99 remaining) [2025-03-04 09:57:42,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 99 remaining) [2025-03-04 09:57:42,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:57:43,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:57:43,083 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 09:57:43,113 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:57:43,113 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:57:43,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:57:43 BasicIcfg [2025-03-04 09:57:43,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:57:43,118 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:57:43,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:57:43,118 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:57:43,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:57:32" (3/4) ... [2025-03-04 09:57:43,120 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:57:43,120 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:57:43,121 INFO L158 Benchmark]: Toolchain (without parser) took 12569.82ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 90.4MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 446.1MB. Max. memory is 16.1GB. [2025-03-04 09:57:43,121 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:57:43,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.11ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 63.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:57:43,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.69ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 60.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:57:43,122 INFO L158 Benchmark]: Boogie Preprocessor took 62.72ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 56.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:57:43,122 INFO L158 Benchmark]: IcfgBuilder took 1511.03ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 56.0MB in the beginning and 126.8MB in the end (delta: -70.9MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2025-03-04 09:57:43,122 INFO L158 Benchmark]: TraceAbstraction took 10513.23ms. Allocated memory was 176.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 126.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 422.7MB. Max. memory is 16.1GB. [2025-03-04 09:57:43,123 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 160.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:57:43,124 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.32ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.11ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 63.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.69ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 60.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.72ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 56.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1511.03ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 56.0MB in the beginning and 126.8MB in the end (delta: -70.9MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10513.23ms. Allocated memory was 176.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 126.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 422.7MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 160.1kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L873] 0 pthread_t t2369; [L874] FCALL, FORK 0 pthread_create(&t2369, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-1, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L875] 0 pthread_t t2370; [L876] FCALL, FORK 0 pthread_create(&t2370, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-1, t2370=0, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L803] 2 x$w_buff1 = x$w_buff0 [L804] 2 x$w_buff0 = 2 [L805] 2 x$w_buff1_used = x$w_buff0_used [L806] 2 x$w_buff0_used = (_Bool)1 [L807] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 2 !expression [L19] CALL 2 reach_error() [L18] COND FALSE 2 !(0) [L18] 2 __assert_fail ("0", "safe025_power.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - 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: 878]: 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: 876]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 162 locations, 99 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: 10.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 0 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=0, InterpolantAutomatonStates: 9, 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.2s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-03-04 09:57:43,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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