./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/singleton_with-uninit-problems.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 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:55:42,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:55:42,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:55:42,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:55:42,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:55:42,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:55:42,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:55:42,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:55:42,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:55:42,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:55:42,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:55:42,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:55:42,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:55:42,218 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:55:42,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:55:42,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:55:42,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:55:42,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:55:42,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:55:42,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:55:42,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:55:42,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:55:42,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:55:42,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:55:42,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:42,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:55:42,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:55:42,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:55:42,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:55:42,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:55:42,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:55:42,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:55:42,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:55:42,222 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 -> 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 [2025-03-09 00:55:42,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:55:42,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:55:42,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:55:42,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:55:42,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:55:42,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2025-03-09 00:55:43,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86fb7a0a9/07718f7f25e6456ab707b83fe5e6095f/FLAG410057cea [2025-03-09 00:55:43,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:55:43,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2025-03-09 00:55:43,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86fb7a0a9/07718f7f25e6456ab707b83fe5e6095f/FLAG410057cea [2025-03-09 00:55:44,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86fb7a0a9/07718f7f25e6456ab707b83fe5e6095f [2025-03-09 00:55:44,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:55:44,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:55:44,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:44,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:55:44,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:55:44,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dedcc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44, skipping insertion in model container [2025-03-09 00:55:44,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:55:44,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:44,586 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:55:44,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:44,687 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:55:44,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44 WrapperNode [2025-03-09 00:55:44,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:44,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:44,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:55:44,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:55:44,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,721 INFO L138 Inliner]: procedures = 323, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 36 [2025-03-09 00:55:44,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:44,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:55:44,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:55:44,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:55:44,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,736 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 00:55:44,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:55:44,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:55:44,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:55:44,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:55:44,749 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (1/1) ... [2025-03-09 00:55:44,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:44,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:44,769 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-09 00:55:44,771 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-09 00:55:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:55:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2025-03-09 00:55:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 00:55:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 00:55:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 00:55:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:55:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:55:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:55:44,788 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:55:44,881 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:55:44,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:55:45,034 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:55:45,034 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:55:45,102 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:55:45,102 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:55:45,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:45 BoogieIcfgContainer [2025-03-09 00:55:45,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:55:45,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:55:45,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:55:45,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:55:45,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:55:44" (1/3) ... [2025-03-09 00:55:45,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b594ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:45, skipping insertion in model container [2025-03-09 00:55:45,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:44" (2/3) ... [2025-03-09 00:55:45,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b594ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:45, skipping insertion in model container [2025-03-09 00:55:45,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:45" (3/3) ... [2025-03-09 00:55:45,109 INFO L128 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2025-03-09 00:55:45,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:55:45,121 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG singleton_with-uninit-problems.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-09 00:55:45,121 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:55:45,206 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-03-09 00:55:45,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 287 flow [2025-03-09 00:55:45,255 INFO L124 PetriNetUnfolderBase]: 8/67 cut-off events. [2025-03-09 00:55:45,257 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 00:55:45,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 67 events. 8/67 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 76. Up to 3 conditions per place. [2025-03-09 00:55:45,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 287 flow [2025-03-09 00:55:45,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 66 transitions, 183 flow [2025-03-09 00:55:45,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:45,278 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;@6a698f93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:45,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-09 00:55:45,282 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:45,282 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-03-09 00:55:45,282 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:55:45,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:45,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:45,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-03-09 00:55:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash 457825107, now seen corresponding path program 1 times [2025-03-09 00:55:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:45,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436210636] [2025-03-09 00:55:45,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:45,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:55:45,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:55:45,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:45,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:45,492 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-09 00:55:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436210636] [2025-03-09 00:55:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436210636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:45,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:45,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855881928] [2025-03-09 00:55:45,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:45,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:45,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:45,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:45,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 97 [2025-03-09 00:55:45,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 00:55:45,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:45,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 97 [2025-03-09 00:55:45,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:46,166 INFO L124 PetriNetUnfolderBase]: 4536/6226 cut-off events. [2025-03-09 00:55:46,167 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2025-03-09 00:55:46,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13015 conditions, 6226 events. 4536/6226 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 32237 event pairs, 3591 based on Foata normal form. 2/4647 useless extension candidates. Maximal degree in co-relation 12980. Up to 6078 conditions per place. [2025-03-09 00:55:46,234 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 46 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2025-03-09 00:55:46,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 59 transitions, 263 flow [2025-03-09 00:55:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-03-09 00:55:46,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41580756013745707 [2025-03-09 00:55:46,247 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 183 flow. Second operand 3 states and 121 transitions. [2025-03-09 00:55:46,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 59 transitions, 263 flow [2025-03-09 00:55:46,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 229 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-09 00:55:46,279 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 133 flow [2025-03-09 00:55:46,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2025-03-09 00:55:46,284 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -17 predicate places. [2025-03-09 00:55:46,285 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 133 flow [2025-03-09 00:55:46,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 00:55:46,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:46,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:46,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:55:46,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-03-09 00:55:46,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:46,287 INFO L85 PathProgramCache]: Analyzing trace with hash -399265484, now seen corresponding path program 1 times [2025-03-09 00:55:46,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:46,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805609377] [2025-03-09 00:55:46,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:46,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:46,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:55:46,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:55:46,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:46,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:46,438 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-09 00:55:46,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805609377] [2025-03-09 00:55:46,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805609377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:46,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:46,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937961315] [2025-03-09 00:55:46,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:46,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:46,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:46,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:46,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:46,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 97 [2025-03-09 00:55:46,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 00:55:46,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:46,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 97 [2025-03-09 00:55:46,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:46,712 INFO L124 PetriNetUnfolderBase]: 1485/2129 cut-off events. [2025-03-09 00:55:46,712 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 00:55:46,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 2129 events. 1485/2129 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9259 event pairs, 1115 based on Foata normal form. 0/2020 useless extension candidates. Maximal degree in co-relation 2395. Up to 2057 conditions per place. [2025-03-09 00:55:46,725 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 42 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2025-03-09 00:55:46,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 211 flow [2025-03-09 00:55:46,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-09 00:55:46,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3951890034364261 [2025-03-09 00:55:46,728 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 133 flow. Second operand 3 states and 115 transitions. [2025-03-09 00:55:46,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 211 flow [2025-03-09 00:55:46,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:46,730 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 122 flow [2025-03-09 00:55:46,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=122, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-03-09 00:55:46,731 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -22 predicate places. [2025-03-09 00:55:46,731 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 122 flow [2025-03-09 00:55:46,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 00:55:46,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:46,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:46,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:55:46,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-03-09 00:55:46,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1900704247, now seen corresponding path program 1 times [2025-03-09 00:55:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:46,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213080285] [2025-03-09 00:55:46,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:46,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 00:55:46,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 00:55:46,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:46,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:46,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:55:46,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 00:55:46,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 00:55:46,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:46,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:46,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:55:46,827 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:55:46,828 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 29 remaining) [2025-03-09 00:55:46,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 29 remaining) [2025-03-09 00:55:46,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2025-03-09 00:55:46,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2025-03-09 00:55:46,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 29 remaining) [2025-03-09 00:55:46,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (14 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2025-03-09 00:55:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 29 remaining) [2025-03-09 00:55:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 29 remaining) [2025-03-09 00:55:46,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:55:46,835 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 00:55:46,897 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:55:46,897 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:55:46,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:55:46 BasicIcfg [2025-03-09 00:55:46,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:55:46,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:55:46,903 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:55:46,903 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:55:46,903 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:45" (3/4) ... [2025-03-09 00:55:46,904 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:55:46,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:55:46,905 INFO L158 Benchmark]: Toolchain (without parser) took 2687.84ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 104.0MB in the beginning and 133.3MB in the end (delta: -29.3MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. [2025-03-09 00:55:46,906 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:46,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.55ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 71.8MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 00:55:46,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.27ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 69.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:46,909 INFO L158 Benchmark]: Boogie Preprocessor took 25.60ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 68.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:55:46,910 INFO L158 Benchmark]: IcfgBuilder took 354.51ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 45.1MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 00:55:46,910 INFO L158 Benchmark]: TraceAbstraction took 1797.89ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 44.5MB in the beginning and 133.3MB in the end (delta: -88.9MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2025-03-09 00:55:46,910 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 285.2MB. Free memory was 133.3MB in the beginning and 133.3MB in the end (delta: 15.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:55:46,911 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.16ms. Allocated memory is still 167.8MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.55ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 71.8MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.27ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 69.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.60ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 68.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 354.51ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 45.1MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1797.89ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 44.5MB in the beginning and 133.3MB in the end (delta: -88.9MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 285.2MB. Free memory was 133.3MB in the beginning and 133.3MB in the end (delta: 15.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1159]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1159. Possible FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [\old(arg)={0:0}, t=-2, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, t1=-1, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-1, v={-3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, v={-3:0}] [L1133] 3 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, v={-3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, v={-3:0}] [L1140] 4 v[0] = 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, v={-3:0}] [L1135] 3 return 0; [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, v={-3:0}] [L1133] 5 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, v={-3:0}] [L1142] 4 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, v={-3:0}] [L1133] 6 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, v={-3:0}] [L1135] 5 return 0; [L1135] 6 return 0; [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, v={-3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, v={-3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, v={-3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, v={-3:0}] [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, t=-2, v={-3:0}] [L1164] EXPR 0 v[0] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, t=-2, v={-3:0}] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, v={-3:0}] [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1123] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, t1=-1, t2=0, t3=1, t4=2, t5=3, v={-3:0}] [L1164] RET 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1165] 0 return 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-1, t2=0, t3=1, t4=2, t5=3, t=-2, v={-3:0}] - UnprovableResult [Line: 1150]: 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: 1151]: 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: 1152]: 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: 1147]: 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: 1149]: 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: -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: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1162]: 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: 1147]: 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: 1149]: 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: 1150]: 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: 1151]: 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: 1152]: 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 11 procedures, 110 locations, 134 edges, 29 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: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 5 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=0, InterpolantAutomatonStates: 6, 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.2s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-09 00:55:46,924 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/singleton_with-uninit-problems.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 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:55:48,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:55:48,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 00:55:48,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:55:48,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:55:48,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:55:48,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:55:48,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:55:48,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:55:48,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:55:48,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:55:48,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:55:48,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:55:48,893 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:55:48,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:55:48,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:55:48,895 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:55:48,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:55:48,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:48,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:55:48,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:55:48,897 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:55:48,897 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:55:48,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:55:48,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:55:48,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:55:48,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:55:48,897 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 -> 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 [2025-03-09 00:55:49,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:55:49,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:55:49,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:55:49,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:55:49,200 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:55:49,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2025-03-09 00:55:50,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bead50645/de7b9caaf4fa4200a59af7e4865ffeab/FLAGda8051cca [2025-03-09 00:55:50,606 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:55:50,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2025-03-09 00:55:50,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bead50645/de7b9caaf4fa4200a59af7e4865ffeab/FLAGda8051cca [2025-03-09 00:55:50,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bead50645/de7b9caaf4fa4200a59af7e4865ffeab [2025-03-09 00:55:50,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:55:50,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:55:50,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:50,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:55:50,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:55:50,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122df84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50, skipping insertion in model container [2025-03-09 00:55:50,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:55:51,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:51,058 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:55:51,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:51,154 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:55:51,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51 WrapperNode [2025-03-09 00:55:51,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:51,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:51,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:55:51,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:55:51,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,198 INFO L138 Inliner]: procedures = 324, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 37 [2025-03-09 00:55:51,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:51,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:55:51,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:55:51,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:55:51,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,226 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 00:55:51,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:55:51,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:55:51,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:55:51,250 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:55:51,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (1/1) ... [2025-03-09 00:55:51,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:51,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:51,283 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-09 00:55:51,285 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-09 00:55:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-09 00:55:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-09 00:55:51,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:55:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-09 00:55:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-09 00:55:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:55:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:55:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:55:51,302 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2025-03-09 00:55:51,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2025-03-09 00:55:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 00:55:51,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 00:55:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 00:55:51,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 00:55:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 00:55:51,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 00:55:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:55:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:55:51,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:55:51,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:55:51,304 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:55:51,410 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:55:51,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:55:51,576 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:55:51,577 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:55:51,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:55:51,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:55:51,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:51 BoogieIcfgContainer [2025-03-09 00:55:51,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:55:51,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:55:51,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:55:51,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:55:51,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:55:50" (1/3) ... [2025-03-09 00:55:51,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733b523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:51, skipping insertion in model container [2025-03-09 00:55:51,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:51" (2/3) ... [2025-03-09 00:55:51,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733b523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:51, skipping insertion in model container [2025-03-09 00:55:51,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:51" (3/3) ... [2025-03-09 00:55:51,666 INFO L128 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2025-03-09 00:55:51,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:55:51,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG singleton_with-uninit-problems.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-09 00:55:51,678 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:55:51,765 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-03-09 00:55:51,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 287 flow [2025-03-09 00:55:51,820 INFO L124 PetriNetUnfolderBase]: 8/67 cut-off events. [2025-03-09 00:55:51,821 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 00:55:51,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 67 events. 8/67 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 76. Up to 3 conditions per place. [2025-03-09 00:55:51,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 287 flow [2025-03-09 00:55:51,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 66 transitions, 183 flow [2025-03-09 00:55:51,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:51,839 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;@6e341673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:51,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-09 00:55:51,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:51,845 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-03-09 00:55:51,845 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 00:55:51,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:51,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:51,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-03-09 00:55:51,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1824218603, now seen corresponding path program 1 times [2025-03-09 00:55:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:55:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468954978] [2025-03-09 00:55:51,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:51,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:51,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:51,862 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-09 00:55:51,863 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-09 00:55:51,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:55:51,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:55:51,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:51,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:51,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:55:51,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:52,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-09 00:55:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:52,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:55:52,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:55:52,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468954978] [2025-03-09 00:55:52,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468954978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:52,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:52,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:52,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494668240] [2025-03-09 00:55:52,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:52,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:55:52,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:52,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:52,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 97 [2025-03-09 00:55:52,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 00:55:52,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:52,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 97 [2025-03-09 00:55:52,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:52,699 INFO L124 PetriNetUnfolderBase]: 4536/6226 cut-off events. [2025-03-09 00:55:52,699 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2025-03-09 00:55:52,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13015 conditions, 6226 events. 4536/6226 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 32237 event pairs, 3591 based on Foata normal form. 2/4647 useless extension candidates. Maximal degree in co-relation 12980. Up to 6078 conditions per place. [2025-03-09 00:55:52,747 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 46 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2025-03-09 00:55:52,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 59 transitions, 263 flow [2025-03-09 00:55:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-03-09 00:55:52,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41580756013745707 [2025-03-09 00:55:52,757 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 183 flow. Second operand 3 states and 121 transitions. [2025-03-09 00:55:52,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 59 transitions, 263 flow [2025-03-09 00:55:52,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 229 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-09 00:55:52,794 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 133 flow [2025-03-09 00:55:52,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2025-03-09 00:55:52,799 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -17 predicate places. [2025-03-09 00:55:52,801 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 133 flow [2025-03-09 00:55:52,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 00:55:52,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:52,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:52,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:55:53,002 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-09 00:55:53,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-03-09 00:55:53,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1613658102, now seen corresponding path program 1 times [2025-03-09 00:55:53,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:55:53,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773223041] [2025-03-09 00:55:53,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:53,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:53,009 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-09 00:55:53,010 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-09 00:55:53,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:55:53,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:55:53,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:53,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:53,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:55:53,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:53,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 00:55:53,133 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-09 00:55:53,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:55:53,134 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:55:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773223041] [2025-03-09 00:55:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773223041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:53,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762942529] [2025-03-09 00:55:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:53,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:55:53,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:53,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:53,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 97 [2025-03-09 00:55:53,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 00:55:53,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:53,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 97 [2025-03-09 00:55:53,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:53,379 INFO L124 PetriNetUnfolderBase]: 1485/2129 cut-off events. [2025-03-09 00:55:53,380 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 00:55:53,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 2129 events. 1485/2129 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9259 event pairs, 1115 based on Foata normal form. 0/2020 useless extension candidates. Maximal degree in co-relation 2395. Up to 2057 conditions per place. [2025-03-09 00:55:53,388 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 42 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2025-03-09 00:55:53,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 211 flow [2025-03-09 00:55:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-09 00:55:53,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3951890034364261 [2025-03-09 00:55:53,389 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 133 flow. Second operand 3 states and 115 transitions. [2025-03-09 00:55:53,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 211 flow [2025-03-09 00:55:53,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:53,391 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 122 flow [2025-03-09 00:55:53,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=122, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-03-09 00:55:53,392 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -22 predicate places. [2025-03-09 00:55:53,392 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 122 flow [2025-03-09 00:55:53,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 00:55:53,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:53,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:53,398 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-09 00:55:53,592 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-09 00:55:53,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 26 more)] === [2025-03-09 00:55:53,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1240666887, now seen corresponding path program 1 times [2025-03-09 00:55:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:55:53,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009235552] [2025-03-09 00:55:53,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:53,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:53,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:53,596 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-09 00:55:53,597 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-09 00:55:53,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 00:55:53,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 00:55:53,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:53,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:53,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:55:53,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 00:55:53,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 00:55:53,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:53,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:53,778 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 00:55:53,778 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:55:53,779 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (28 of 29 remaining) [2025-03-09 00:55:53,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 29 remaining) [2025-03-09 00:55:53,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (14 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork3Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 29 remaining) [2025-03-09 00:55:53,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 29 remaining) [2025-03-09 00:55:53,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 29 remaining) [2025-03-09 00:55:53,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 29 remaining) [2025-03-09 00:55:53,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 29 remaining) [2025-03-09 00:55:53,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 29 remaining) [2025-03-09 00:55:53,790 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-09 00:55:53,983 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-09 00:55:53,984 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 00:55:54,035 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:55:54,036 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:55:54,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:55:54 BasicIcfg [2025-03-09 00:55:54,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:55:54,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:55:54,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:55:54,041 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:55:54,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:51" (3/4) ... [2025-03-09 00:55:54,044 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:55:54,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:55:54,046 INFO L158 Benchmark]: Toolchain (without parser) took 3399.78ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.2MB in the beginning and 113.2MB in the end (delta: -22.1MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2025-03-09 00:55:54,046 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:54,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.29ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 57.9MB in the end (delta: 33.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 00:55:54,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.96ms. Allocated memory is still 117.4MB. Free memory was 57.9MB in the beginning and 55.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:54,047 INFO L158 Benchmark]: Boogie Preprocessor took 50.07ms. Allocated memory is still 117.4MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:55:54,047 INFO L158 Benchmark]: IcfgBuilder took 408.71ms. Allocated memory is still 117.4MB. Free memory was 53.7MB in the beginning and 77.0MB in the end (delta: -23.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-03-09 00:55:54,048 INFO L158 Benchmark]: TraceAbstraction took 2378.86ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 76.2MB in the beginning and 115.3MB in the end (delta: -39.1MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2025-03-09 00:55:54,048 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 234.9MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:54,049 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.29ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 57.9MB in the end (delta: 33.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.96ms. Allocated memory is still 117.4MB. Free memory was 57.9MB in the beginning and 55.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.07ms. Allocated memory is still 117.4MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 408.71ms. Allocated memory is still 117.4MB. Free memory was 53.7MB in the beginning and 77.0MB in the end (delta: -23.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2378.86ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 76.2MB in the beginning and 115.3MB in the end (delta: -39.1MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 234.9MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1159]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1159. Possible FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [\old(arg)={0:0}, t=-5, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, t1=-4, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-4, v={4:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, v={4:0}] [L1133] 3 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, v={4:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, v={4:0}] [L1140] 4 v[0] = 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, v={4:0}] [L1135] 3 return 0; [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, v={4:0}] [L1133] 5 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, v={4:0}] [L1142] 4 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={4:0}] [L1133] 6 v[0] = 'X' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={4:0}] [L1135] 5 return 0; [L1135] 6 return 0; [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={4:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={4:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={4:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={4:0}] [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={4:0}] [L1164] EXPR 0 v[0] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={4:0}] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={4:0}] [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1123] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={4:0}] [L1164] RET 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1165] 0 return 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={4:0}] - UnprovableResult [Line: 1150]: 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: 1151]: 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: 1152]: 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: 1147]: 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: 1149]: 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: -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: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1162]: 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: 1147]: 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: 1149]: 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: 1150]: 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: 1151]: 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: 1152]: 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 11 procedures, 110 locations, 134 edges, 29 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: 2.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 9 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=0, InterpolantAutomatonStates: 6, 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.1s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 122 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-09 00:55:54,066 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