./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/reorder_5-2.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/reorder_5-2.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 41850eb6fd386c6f0f40e76b0dfccb7c973d8ab2a3ee3a82b04526b3663119f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:55:24,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:55:24,701 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:24,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:55:24,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:55:24,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:55:24,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:55:24,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:55:24,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:55:24,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:55:24,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:55:24,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:55:24,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:55:24,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:55:24,726 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:55:24,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:55:24,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:55:24,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:55:24,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:55:24,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:55:24,730 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:55:24,730 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:55:24,730 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:55:24,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:55:24,730 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:55:24,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:55:24,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:24,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:55:24,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:55:24,731 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 -> 41850eb6fd386c6f0f40e76b0dfccb7c973d8ab2a3ee3a82b04526b3663119f9 [2025-03-09 00:55:24,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:55:24,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:55:24,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:55:24,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:55:24,964 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:55:24,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5-2.i [2025-03-09 00:55:26,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce5e99a3/327286ca444d400db85635d90187d182/FLAG5a0aca70b [2025-03-09 00:55:26,442 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:55:26,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5-2.i [2025-03-09 00:55:26,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce5e99a3/327286ca444d400db85635d90187d182/FLAG5a0aca70b [2025-03-09 00:55:26,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce5e99a3/327286ca444d400db85635d90187d182 [2025-03-09 00:55:26,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:55:26,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:55:26,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:26,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:55:26,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:55:26,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:26" (1/1) ... [2025-03-09 00:55:26,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d30137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:26, skipping insertion in model container [2025-03-09 00:55:26,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:26" (1/1) ... [2025-03-09 00:55:26,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:55:27,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:27,164 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:55:27,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:27,273 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:55:27,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:27 WrapperNode [2025-03-09 00:55:27,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:27,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:27,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:55:27,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:55:27,281 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:27" (1/1) ... [2025-03-09 00:55:27,294 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:27" (1/1) ... [2025-03-09 00:55:27,314 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2025-03-09 00:55:27,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:27,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:55:27,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:55:27,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:55:27,320 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:27" (1/1) ... [2025-03-09 00:55:27,320 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:27" (1/1) ... [2025-03-09 00:55:27,322 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:27" (1/1) ... [2025-03-09 00:55:27,339 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-09 00:55:27,339 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:27" (1/1) ... [2025-03-09 00:55:27,339 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:27" (1/1) ... [2025-03-09 00:55:27,344 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:27" (1/1) ... [2025-03-09 00:55:27,344 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:27" (1/1) ... [2025-03-09 00:55:27,345 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:27" (1/1) ... [2025-03-09 00:55:27,346 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:27" (1/1) ... [2025-03-09 00:55:27,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:55:27,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:55:27,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:55:27,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:55:27,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:27" (1/1) ... [2025-03-09 00:55:27,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:27,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:27,372 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:27,374 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:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:55:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:55:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:55:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:55:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:55:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:55:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:55:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-09 00:55:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-09 00:55:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:55:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:55:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:55:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:55:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-09 00:55:27,390 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-09 00:55:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:55:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:55:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:55:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:55:27,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:55:27,391 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:27,493 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:55:27,495 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:55:27,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1249: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-03-09 00:55:27,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1249-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-03-09 00:55:27,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1250: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-03-09 00:55:27,682 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1250-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-03-09 00:55:27,682 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:55:27,682 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:55:27,789 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:55:27,789 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:55:27,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:27 BoogieIcfgContainer [2025-03-09 00:55:27,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:55:27,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:55:27,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:55:27,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:55:27,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:55:26" (1/3) ... [2025-03-09 00:55:27,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ec3c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:27, skipping insertion in model container [2025-03-09 00:55:27,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:27" (2/3) ... [2025-03-09 00:55:27,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ec3c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:27, skipping insertion in model container [2025-03-09 00:55:27,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:27" (3/3) ... [2025-03-09 00:55:27,799 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5-2.i [2025-03-09 00:55:27,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:55:27,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5-2.i that has 3 procedures, 48 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-09 00:55:27,814 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:55:27,861 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 00:55:27,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:27,936 INFO L124 PetriNetUnfolderBase]: 12/131 cut-off events. [2025-03-09 00:55:27,938 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 00:55:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 12/131 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 666 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 69. Up to 7 conditions per place. [2025-03-09 00:55:27,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:27,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:27,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:27,957 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;@40966466, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:27,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 00:55:27,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:27,961 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 00:55:27,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:55:27,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:27,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 00:55:27,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:27,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash 9574204, now seen corresponding path program 1 times [2025-03-09 00:55:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:27,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359965322] [2025-03-09 00:55:27,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:28,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:55:28,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:55:28,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:28,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:28,103 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:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359965322] [2025-03-09 00:55:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359965322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:28,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:28,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:55:28,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784510108] [2025-03-09 00:55:28,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:28,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:55:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:28,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:55:28,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:55:28,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2025-03-09 00:55:28,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:28,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:28,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2025-03-09 00:55:28,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:28,291 INFO L124 PetriNetUnfolderBase]: 286/729 cut-off events. [2025-03-09 00:55:28,291 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-09 00:55:28,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 729 events. 286/729 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4325 event pairs, 263 based on Foata normal form. 38/668 useless extension candidates. Maximal degree in co-relation 1001. Up to 528 conditions per place. [2025-03-09 00:55:28,297 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 28 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-03-09 00:55:28,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 180 flow [2025-03-09 00:55:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:55:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:55:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-03-09 00:55:28,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-03-09 00:55:28,310 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 132 flow. Second operand 2 states and 80 transitions. [2025-03-09 00:55:28,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 180 flow [2025-03-09 00:55:28,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:28,315 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 124 flow [2025-03-09 00:55:28,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-03-09 00:55:28,321 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-09 00:55:28,321 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 124 flow [2025-03-09 00:55:28,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:28,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:28,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:28,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:55:28,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash 296832934, now seen corresponding path program 1 times [2025-03-09 00:55:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547050740] [2025-03-09 00:55:28,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:28,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:28,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:28,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:28,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:28,478 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:28,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:28,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547050740] [2025-03-09 00:55:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547050740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:28,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:28,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181329641] [2025-03-09 00:55:28,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:28,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:28,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:28,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:28,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:28,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-03-09 00:55:28,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:28,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:28,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-03-09 00:55:28,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:28,630 INFO L124 PetriNetUnfolderBase]: 327/792 cut-off events. [2025-03-09 00:55:28,630 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-09 00:55:28,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 792 events. 327/792 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4808 event pairs, 228 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 1429. Up to 464 conditions per place. [2025-03-09 00:55:28,638 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-09 00:55:28,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 208 flow [2025-03-09 00:55:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-09 00:55:28,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-09 00:55:28,641 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 124 flow. Second operand 3 states and 99 transitions. [2025-03-09 00:55:28,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 208 flow [2025-03-09 00:55:28,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:28,644 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 124 flow [2025-03-09 00:55:28,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-09 00:55:28,645 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-09 00:55:28,645 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 124 flow [2025-03-09 00:55:28,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:28,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:28,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:28,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:55:28,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:28,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash 296832935, now seen corresponding path program 1 times [2025-03-09 00:55:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:28,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551895354] [2025-03-09 00:55:28,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:28,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:28,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:28,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:28,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:28,882 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:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551895354] [2025-03-09 00:55:28,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551895354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:28,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:28,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:28,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413912667] [2025-03-09 00:55:28,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:28,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:28,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:28,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:28,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 00:55:28,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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:28,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:28,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 00:55:28,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:29,197 INFO L124 PetriNetUnfolderBase]: 638/1611 cut-off events. [2025-03-09 00:55:29,197 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-03-09 00:55:29,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 1611 events. 638/1611 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11849 event pairs, 444 based on Foata normal form. 1/1447 useless extension candidates. Maximal degree in co-relation 2910. Up to 603 conditions per place. [2025-03-09 00:55:29,225 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 57 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-03-09 00:55:29,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 330 flow [2025-03-09 00:55:29,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-03-09 00:55:29,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6741071428571429 [2025-03-09 00:55:29,227 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 124 flow. Second operand 4 states and 151 transitions. [2025-03-09 00:55:29,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 330 flow [2025-03-09 00:55:29,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:29,231 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 146 flow [2025-03-09 00:55:29,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-09 00:55:29,232 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-03-09 00:55:29,233 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 146 flow [2025-03-09 00:55:29,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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:29,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:29,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:29,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:55:29,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:29,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1349175202, now seen corresponding path program 1 times [2025-03-09 00:55:29,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876016352] [2025-03-09 00:55:29,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:29,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:29,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:29,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:29,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:29,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:55:29,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:29,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:29,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:29,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:29,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:55:29,272 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:55:29,272 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2025-03-09 00:55:29,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-09 00:55:29,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2025-03-09 00:55:29,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (11 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2025-03-09 00:55:29,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2025-03-09 00:55:29,276 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-03-09 00:55:29,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:55:29,276 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 00:55:29,296 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:55:29,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:55:29,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:55:29 BasicIcfg [2025-03-09 00:55:29,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:55:29,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:55:29,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:55:29,305 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:55:29,305 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:27" (3/4) ... [2025-03-09 00:55:29,306 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:55:29,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:55:29,308 INFO L158 Benchmark]: Toolchain (without parser) took 2613.53ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 115.3MB in the end (delta: 6.6MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2025-03-09 00:55:29,308 INFO L158 Benchmark]: CDTParser took 1.31ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:29,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.13ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 83.4MB in the end (delta: 38.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 00:55:29,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.53ms. Allocated memory is still 167.8MB. Free memory was 83.4MB in the beginning and 81.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:29,309 INFO L158 Benchmark]: Boogie Preprocessor took 33.44ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 79.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:29,310 INFO L158 Benchmark]: IcfgBuilder took 440.89ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 50.8MB in the end (delta: 28.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 00:55:29,310 INFO L158 Benchmark]: TraceAbstraction took 1511.02ms. Allocated memory is still 167.8MB. Free memory was 49.8MB in the beginning and 115.3MB in the end (delta: -65.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:29,310 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 115.3MB in the end (delta: 30.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:55:29,311 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.13ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 83.4MB in the end (delta: 38.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.53ms. Allocated memory is still 167.8MB. Free memory was 83.4MB in the beginning and 81.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.44ms. Allocated memory is still 167.8MB. Free memory was 81.4MB in the beginning and 79.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 440.89ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 50.8MB in the end (delta: 28.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1511.02ms. Allocated memory is still 167.8MB. Free memory was 49.8MB in the beginning and 115.3MB in the end (delta: -65.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 115.3MB in the end (delta: 30.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of sscanf at line 1245, overapproximation of sscanf at line 1246. Possible FailurePath: [L1229] static int iSet = 4; [L1230] static int iCheck = 1; [L1231] static int a = 0; [L1232] static int b = 0; [L1239] int i, err; VAL [\old(argc)=3, \old(argv)={1073741825:1073741826}, a=0, argc=3, b=0, iCheck=1, iSet=4] [L1240] COND TRUE argc != 1 VAL [\old(argc)=3, \old(argv)={1073741825:1073741826}, a=0, argc=3, b=0, iCheck=1, iSet=4] [L1241] COND FALSE !(argc != 3) VAL [\old(argc)=3, \old(argv)={1073741825:1073741826}, a=0, argc=3, b=0, iCheck=1, iSet=4] [L1245] argv[1] [L1246] argv[2] [L1249] pthread_t setPool[iSet]; [L1250] pthread_t checkPool[iCheck]; [L1251] i = 0 VAL [\old(argc)=3, \old(argv)={1073741825:1073741826}, a=0, argc=3, b=0, checkPool={5:0}, i=0, iCheck=0, iSet=1073741824, setPool={4:0}] [L1251] COND TRUE i < iSet - UnprovableResult [Line: 11]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1245]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: 1238]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1258]: 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: 1252]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 63 locations, 72 edges, 15 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.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 319 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 15 mSDtfsCounter, 319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 00:55:29,328 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/reorder_5-2.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 41850eb6fd386c6f0f40e76b0dfccb7c973d8ab2a3ee3a82b04526b3663119f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:55:31,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:55:31,201 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:31,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:55:31,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:55:31,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:55:31,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:55:31,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:55:31,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:55:31,234 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:55:31,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:55:31,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:55:31,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:55:31,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:55:31,235 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:55:31,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:55:31,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:55:31,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:55:31,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:55:31,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:31,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:55:31,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:55:31,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:55:31,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:55:31,237 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 -> 41850eb6fd386c6f0f40e76b0dfccb7c973d8ab2a3ee3a82b04526b3663119f9 [2025-03-09 00:55:31,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:55:31,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:55:31,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:55:31,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:55:31,483 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:55:31,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5-2.i [2025-03-09 00:55:32,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3d01275/64d7b2c34cb240fda4cd28800f01b9d8/FLAG7f9680492 [2025-03-09 00:55:32,900 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:55:32,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5-2.i [2025-03-09 00:55:32,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3d01275/64d7b2c34cb240fda4cd28800f01b9d8/FLAG7f9680492 [2025-03-09 00:55:32,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3d01275/64d7b2c34cb240fda4cd28800f01b9d8 [2025-03-09 00:55:32,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:55:32,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:55:32,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:32,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:55:32,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:55:32,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8d7dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32, skipping insertion in model container [2025-03-09 00:55:32,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:55:33,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:33,291 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:55:33,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:33,413 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:55:33,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:33 WrapperNode [2025-03-09 00:55:33,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:33,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:33,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:55:33,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:55:33,420 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:33" (1/1) ... [2025-03-09 00:55:33,444 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:33" (1/1) ... [2025-03-09 00:55:33,463 INFO L138 Inliner]: procedures = 374, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2025-03-09 00:55:33,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:33,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:55:33,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:55:33,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:55:33,471 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:33" (1/1) ... [2025-03-09 00:55:33,472 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:33" (1/1) ... [2025-03-09 00:55:33,474 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:33" (1/1) ... [2025-03-09 00:55:33,486 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-09 00:55:33,489 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:33" (1/1) ... [2025-03-09 00:55:33,489 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:33" (1/1) ... [2025-03-09 00:55:33,498 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:33" (1/1) ... [2025-03-09 00:55:33,499 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:33" (1/1) ... [2025-03-09 00:55:33,504 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:33" (1/1) ... [2025-03-09 00:55:33,505 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:33" (1/1) ... [2025-03-09 00:55:33,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:55:33,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:55:33,507 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:55:33,507 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:55:33,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:33" (1/1) ... [2025-03-09 00:55:33,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:33,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:33,541 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:33,543 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:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 00:55:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 00:55:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-09 00:55:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:55:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-09 00:55:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-09 00:55:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-09 00:55:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:55:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:55:33,561 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:33,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:55:33,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:55:33,905 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1249: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-03-09 00:55:33,905 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1249-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-03-09 00:55:33,905 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1250: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-03-09 00:55:33,905 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1250-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-03-09 00:55:33,906 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:55:33,906 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:55:34,023 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:55:34,023 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:55:34,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:34 BoogieIcfgContainer [2025-03-09 00:55:34,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:55:34,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:55:34,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:55:34,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:55:34,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:55:32" (1/3) ... [2025-03-09 00:55:34,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5eac18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:34, skipping insertion in model container [2025-03-09 00:55:34,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:33" (2/3) ... [2025-03-09 00:55:34,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5eac18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:34, skipping insertion in model container [2025-03-09 00:55:34,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:34" (3/3) ... [2025-03-09 00:55:34,031 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5-2.i [2025-03-09 00:55:34,041 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:55:34,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5-2.i that has 3 procedures, 48 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-09 00:55:34,042 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:55:34,083 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 00:55:34,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:34,148 INFO L124 PetriNetUnfolderBase]: 12/131 cut-off events. [2025-03-09 00:55:34,150 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 00:55:34,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 12/131 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 665 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 69. Up to 7 conditions per place. [2025-03-09 00:55:34,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:34,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:34,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:34,170 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;@44e22e2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:34,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 00:55:34,174 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:34,174 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 00:55:34,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:55:34,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:34,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 00:55:34,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:34,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash 9635679, now seen corresponding path program 1 times [2025-03-09 00:55:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:55:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104169368] [2025-03-09 00:55:34,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:34,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:34,187 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:34,188 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:34,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:55:34,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:55:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:34,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 00:55:34,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:34,283 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:34,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:55:34,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:55:34,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104169368] [2025-03-09 00:55:34,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104169368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:34,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:34,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:55:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843489854] [2025-03-09 00:55:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:34,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:55:34,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:55:34,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:55:34,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:55:34,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2025-03-09 00:55:34,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:34,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:34,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2025-03-09 00:55:34,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:34,435 INFO L124 PetriNetUnfolderBase]: 286/729 cut-off events. [2025-03-09 00:55:34,436 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-09 00:55:34,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 729 events. 286/729 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4333 event pairs, 263 based on Foata normal form. 38/667 useless extension candidates. Maximal degree in co-relation 1001. Up to 528 conditions per place. [2025-03-09 00:55:34,441 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 28 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-03-09 00:55:34,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 180 flow [2025-03-09 00:55:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:55:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:55:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-03-09 00:55:34,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-03-09 00:55:34,454 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 132 flow. Second operand 2 states and 80 transitions. [2025-03-09 00:55:34,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 180 flow [2025-03-09 00:55:34,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:34,461 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 124 flow [2025-03-09 00:55:34,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-03-09 00:55:34,465 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-09 00:55:34,466 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 124 flow [2025-03-09 00:55:34,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:34,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:34,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:34,472 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:34,670 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:34,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:34,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash 298739498, now seen corresponding path program 1 times [2025-03-09 00:55:34,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:55:34,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469912158] [2025-03-09 00:55:34,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:34,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:34,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:34,673 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:34,674 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:34,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:34,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:34,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:34,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:34,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:55:34,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:34,792 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2025-03-09 00:55:34,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-03-09 00:55:34,804 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:34,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:55:34,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:55:34,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469912158] [2025-03-09 00:55:34,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469912158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:34,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:34,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:34,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065197698] [2025-03-09 00:55:34,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:34,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:34,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:55:34,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:34,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:34,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-03-09 00:55:34,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:34,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:34,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-03-09 00:55:34,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:34,942 INFO L124 PetriNetUnfolderBase]: 327/792 cut-off events. [2025-03-09 00:55:34,943 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-09 00:55:34,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 792 events. 327/792 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4843 event pairs, 228 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 1429. Up to 464 conditions per place. [2025-03-09 00:55:34,949 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-09 00:55:34,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 208 flow [2025-03-09 00:55:34,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-09 00:55:34,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-09 00:55:34,951 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 124 flow. Second operand 3 states and 99 transitions. [2025-03-09 00:55:34,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 208 flow [2025-03-09 00:55:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:34,954 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 124 flow [2025-03-09 00:55:34,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-09 00:55:34,954 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-09 00:55:34,954 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 124 flow [2025-03-09 00:55:34,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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:34,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:34,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:34,962 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:35,160 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:35,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:35,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash 298739499, now seen corresponding path program 1 times [2025-03-09 00:55:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:55:35,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22719766] [2025-03-09 00:55:35,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:35,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:35,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:35,163 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:35,165 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:35,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:35,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:35,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:35,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:35,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:55:35,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:35,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:55:35,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-09 00:55:35,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-09 00:55:35,281 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:35,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:55:35,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:55:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22719766] [2025-03-09 00:55:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22719766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:35,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:35,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:35,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059605393] [2025-03-09 00:55:35,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:35,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:55:35,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:35,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:35,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 00:55:35,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:35,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:35,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 00:55:35,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:35,584 INFO L124 PetriNetUnfolderBase]: 638/1589 cut-off events. [2025-03-09 00:55:35,584 INFO L125 PetriNetUnfolderBase]: For 129/130 co-relation queries the response was YES. [2025-03-09 00:55:35,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 1589 events. 638/1589 cut-off events. For 129/130 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11575 event pairs, 597 based on Foata normal form. 1/1430 useless extension candidates. Maximal degree in co-relation 2888. Up to 603 conditions per place. [2025-03-09 00:55:35,593 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 57 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-03-09 00:55:35,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 330 flow [2025-03-09 00:55:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-03-09 00:55:35,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6741071428571429 [2025-03-09 00:55:35,595 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 124 flow. Second operand 4 states and 151 transitions. [2025-03-09 00:55:35,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 330 flow [2025-03-09 00:55:35,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:35,598 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 146 flow [2025-03-09 00:55:35,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-09 00:55:35,599 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-03-09 00:55:35,599 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 146 flow [2025-03-09 00:55:35,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:35,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:35,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:35,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:55:35,799 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:35,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:35,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash -411190365, now seen corresponding path program 1 times [2025-03-09 00:55:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:55:35,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1907576781] [2025-03-09 00:55:35,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:35,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:35,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:55:35,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:55:35,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:35,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:35,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:35,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:35,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:55:35,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:35,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:35,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:35,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:35,884 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 00:55:35,884 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:55:35,885 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2025-03-09 00:55:35,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-09 00:55:35,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2025-03-09 00:55:35,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (11 of 15 remaining) [2025-03-09 00:55:35,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-09 00:55:35,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-09 00:55:35,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-03-09 00:55:35,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-09 00:55:35,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-09 00:55:35,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-03-09 00:55:35,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-09 00:55:35,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 15 remaining) [2025-03-09 00:55:35,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2025-03-09 00:55:35,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2025-03-09 00:55:35,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-03-09 00:55:35,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:55:36,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:36,088 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 00:55:36,103 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:55:36,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:55:36,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:55:36 BasicIcfg [2025-03-09 00:55:36,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:55:36,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:55:36,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:55:36,107 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:55:36,107 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:34" (3/4) ... [2025-03-09 00:55:36,108 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:55:36,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:55:36,109 INFO L158 Benchmark]: Toolchain (without parser) took 3170.44ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 34.5MB in the end (delta: 56.2MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2025-03-09 00:55:36,110 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:36,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.18ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 51.2MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 00:55:36,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.00ms. Allocated memory is still 117.4MB. Free memory was 51.2MB in the beginning and 48.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:36,110 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 117.4MB. Free memory was 48.9MB in the beginning and 46.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:36,110 INFO L158 Benchmark]: IcfgBuilder took 516.69ms. Allocated memory is still 117.4MB. Free memory was 46.5MB in the beginning and 61.4MB in the end (delta: -14.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-03-09 00:55:36,111 INFO L158 Benchmark]: TraceAbstraction took 2080.33ms. Allocated memory is still 117.4MB. Free memory was 60.7MB in the beginning and 34.5MB in the end (delta: 26.1MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-03-09 00:55:36,111 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 117.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:55:36,114 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.21ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.18ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 51.2MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.00ms. Allocated memory is still 117.4MB. Free memory was 51.2MB in the beginning and 48.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 117.4MB. Free memory was 48.9MB in the beginning and 46.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 516.69ms. Allocated memory is still 117.4MB. Free memory was 46.5MB in the beginning and 61.4MB in the end (delta: -14.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2080.33ms. Allocated memory is still 117.4MB. Free memory was 60.7MB in the beginning and 34.5MB in the end (delta: 26.1MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 117.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of sscanf at line 1246, overapproximation of sscanf at line 1245. Possible FailurePath: [L1229] static int iSet = 4; [L1230] static int iCheck = 1; [L1231] static int a = 0; [L1232] static int b = 0; [L1239] int i, err; VAL [\old(argc)=3, \old(argv)={0:0}, a=0, argc=3, b=0, iCheck=1, iSet=4] [L1240] COND TRUE argc != 1 VAL [\old(argc)=3, \old(argv)={0:0}, a=0, argc=3, b=0, iCheck=1, iSet=4] [L1241] COND FALSE !(argc != 3) VAL [\old(argc)=3, \old(argv)={0:0}, a=0, argc=3, b=0, iCheck=1, iSet=4] [L1245] argv[1] [L1246] argv[2] [L1249] pthread_t setPool[iSet]; [L1250] pthread_t checkPool[iCheck]; [L1251] i = 0 VAL [\old(argc)=3, \old(argv)={0:0}, a=0, argc=3, b=0, checkPool={11:0}, i=0, iCheck=0, iSet=1073741824, setPool={7:0}] [L1251] COND TRUE i < iSet - UnprovableResult [Line: 11]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1245]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: 1238]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1252]: 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: 1258]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 63 locations, 72 edges, 15 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.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 11 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 3 NumberOfNonLiveVariables, 109 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 00:55:36,128 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