./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-memsafety/fillarray1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/fillarray1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d955c319d131d508b8618ef571ba23da865842e29989ccda626762130a6dda2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:15:14,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:15:14,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:15:14,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:15:14,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:15:14,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:15:14,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:15:14,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:15:14,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:15:14,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:15:14,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:15:14,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:15:14,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:15:14,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:15:14,956 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:15:14,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:15:14,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:15:14,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:15:14,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:15:14,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:15:14,957 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:15:14,957 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:15:14,957 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:15:14,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:15:14,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:15:14,958 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:15:14,958 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:15:14,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:15:14,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:15:14,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:15:14,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:14,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:14,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:14,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:14,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:15:14,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:14,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:14,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:14,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:15:14,960 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d955c319d131d508b8618ef571ba23da865842e29989ccda626762130a6dda2 [2025-01-10 01:15:15,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:15:15,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:15:15,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:15:15,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:15:15,203 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:15:15,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/fillarray1.i [2025-01-10 01:15:16,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968eb839c/416b2b286a7e4e4fa7af74357c97d2c3/FLAGc524029ad [2025-01-10 01:15:16,696 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:15:16,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/fillarray1.i [2025-01-10 01:15:16,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968eb839c/416b2b286a7e4e4fa7af74357c97d2c3/FLAGc524029ad [2025-01-10 01:15:16,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968eb839c/416b2b286a7e4e4fa7af74357c97d2c3 [2025-01-10 01:15:16,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:15:16,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:15:16,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:16,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:15:16,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:15:16,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:16" (1/1) ... [2025-01-10 01:15:16,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c7a50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:16, skipping insertion in model container [2025-01-10 01:15:16,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:16" (1/1) ... [2025-01-10 01:15:16,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:15:17,272 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:17,277 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:17,279 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:17,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:17,292 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:15:17,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:17,375 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:15:17,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17 WrapperNode [2025-01-10 01:15:17,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:17,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:17,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:15:17,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:15:17,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,402 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2025-01-10 01:15:17,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:17,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:15:17,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:15:17,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:15:17,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,420 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-01-10 01:15:17,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:15:17,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:15:17,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:15:17,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:15:17,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (1/1) ... [2025-01-10 01:15:17,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:17,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:15:17,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:15:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 01:15:17,482 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 01:15:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 01:15:17,482 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 01:15:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:15:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:15:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:15:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:15:17,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:15:17,483 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:15:17,589 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:15:17,591 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:15:17,749 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:15:17,750 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:15:17,827 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:15:17,829 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:15:17,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:17 BoogieIcfgContainer [2025-01-10 01:15:17,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:15:17,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:15:17,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:15:17,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:15:17,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:15:16" (1/3) ... [2025-01-10 01:15:17,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f960eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:17, skipping insertion in model container [2025-01-10 01:15:17,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:17" (2/3) ... [2025-01-10 01:15:17,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f960eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:17, skipping insertion in model container [2025-01-10 01:15:17,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:17" (3/3) ... [2025-01-10 01:15:17,839 INFO L128 eAbstractionObserver]: Analyzing ICFG fillarray1.i [2025-01-10 01:15:17,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:15:17,849 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fillarray1.i that has 3 procedures, 29 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-01-10 01:15:17,849 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:15:17,891 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:15:17,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 74 flow [2025-01-10 01:15:17,941 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-01-10 01:15:17,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:15:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-01-10 01:15:17,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 33 transitions, 74 flow [2025-01-10 01:15:17,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 68 flow [2025-01-10 01:15:17,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:15:17,970 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;@327e23bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:15:17,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 01:15:17,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:15:17,975 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 01:15:17,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:15:17,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:17,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:15:17,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2025-01-10 01:15:17,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:17,979 INFO L85 PathProgramCache]: Analyzing trace with hash 219818, now seen corresponding path program 1 times [2025-01-10 01:15:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172931776] [2025-01-10 01:15:17,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:18,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:15:18,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:15:18,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:18,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:18,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:18,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172931776] [2025-01-10 01:15:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172931776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:18,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541375511] [2025-01-10 01:15:18,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:18,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:18,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:18,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:18,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:18,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 33 [2025-01-10 01:15:18,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:18,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:18,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 33 [2025-01-10 01:15:18,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:18,272 INFO L124 PetriNetUnfolderBase]: 123/313 cut-off events. [2025-01-10 01:15:18,272 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:15:18,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 313 events. 123/313 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1731 event pairs, 87 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 514. Up to 161 conditions per place. [2025-01-10 01:15:18,277 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 18 selfloop transitions, 3 changer transitions 2/38 dead transitions. [2025-01-10 01:15:18,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 128 flow [2025-01-10 01:15:18,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-10 01:15:18,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-01-10 01:15:18,291 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 68 flow. Second operand 3 states and 75 transitions. [2025-01-10 01:15:18,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 128 flow [2025-01-10 01:15:18,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:18,295 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 75 flow [2025-01-10 01:15:18,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-01-10 01:15:18,300 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2025-01-10 01:15:18,301 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 75 flow [2025-01-10 01:15:18,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:18,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:18,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:18,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:15:18,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2025-01-10 01:15:18,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1205493149, now seen corresponding path program 1 times [2025-01-10 01:15:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:18,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462023392] [2025-01-10 01:15:18,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:18,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:15:18,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:15:18,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:18,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462023392] [2025-01-10 01:15:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462023392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:18,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:18,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295677612] [2025-01-10 01:15:18,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:18,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:18,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:18,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:18,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:18,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 33 [2025-01-10 01:15:18,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:18,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:18,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 33 [2025-01-10 01:15:18,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:18,454 INFO L124 PetriNetUnfolderBase]: 123/295 cut-off events. [2025-01-10 01:15:18,455 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 01:15:18,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 295 events. 123/295 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1568 event pairs, 87 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 530. Up to 160 conditions per place. [2025-01-10 01:15:18,457 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 19 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-01-10 01:15:18,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 127 flow [2025-01-10 01:15:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-01-10 01:15:18,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2025-01-10 01:15:18,458 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 75 flow. Second operand 3 states and 70 transitions. [2025-01-10 01:15:18,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 127 flow [2025-01-10 01:15:18,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 116 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:18,460 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 66 flow [2025-01-10 01:15:18,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-01-10 01:15:18,461 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2025-01-10 01:15:18,461 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 66 flow [2025-01-10 01:15:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:18,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:18,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:15:18,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2025-01-10 01:15:18,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1206400108, now seen corresponding path program 1 times [2025-01-10 01:15:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103800266] [2025-01-10 01:15:18,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:18,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:15:18,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:15:18,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:18,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:15:18,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:15:18,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:15:18,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:15:18,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:18,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:15:18,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:15:18,502 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:15:18,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (12 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (11 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (10 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (9 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-01-10 01:15:18,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-01-10 01:15:18,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2025-01-10 01:15:18,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:15:18,505 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 01:15:18,519 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:15:18,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:15:18,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:15:18 BasicIcfg [2025-01-10 01:15:18,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:15:18,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:15:18,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:15:18,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:15:18,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:17" (3/4) ... [2025-01-10 01:15:18,524 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:15:18,554 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-01-10 01:15:18,586 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:15:18,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:15:18,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:15:18,588 INFO L158 Benchmark]: Toolchain (without parser) took 1637.91ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 54.4MB in the end (delta: 49.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2025-01-10 01:15:18,589 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:15:18,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.11ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 76.3MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:15:18,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.53ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 75.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:15:18,590 INFO L158 Benchmark]: Boogie Preprocessor took 25.86ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:15:18,590 INFO L158 Benchmark]: RCFGBuilder took 401.03ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 51.0MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:15:18,590 INFO L158 Benchmark]: TraceAbstraction took 691.44ms. Allocated memory is still 142.6MB. Free memory was 50.0MB in the beginning and 61.2MB in the end (delta: -11.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:15:18,591 INFO L158 Benchmark]: Witness Printer took 63.60ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 54.4MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:15:18,592 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.11ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 76.3MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.53ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 75.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.86ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 401.03ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 51.0MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 691.44ms. Allocated memory is still 142.6MB. Free memory was 50.0MB in the beginning and 61.2MB in the end (delta: -11.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 63.60ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 54.4MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1037] 0 int size; [L1038] 0 int ind; [L1039] 0 int j = 2, i = 1; [L1040] 0 int x, y, z; [L1068] 0 size = __VERIFIER_nondet_int() [L1069] COND FALSE 0 !(size < 1 || size > 20) [L1072] 0 int *a = (int *)malloc(size); [L1073] 0 pthread_t id1, id2; [L1074] 0 ind = 0 [L1075] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, a) VAL [\old(arg)={-1:0}, \old(argc)=6, \old(argv)={4:5}, a={-1:0}, argc=6, i=1, id1=0, ind=0, j=2, size=2, x=0, y=0, z=0] [L1042] 1 x = 1 [L1043] 1 y = 1 [L1044] 1 int *a = (int *)arg; VAL [\old(arg)={-1:0}, a={-1:0}, arg={-1:0}, i=1, ind=0, j=2, size=2, x=1, y=1, z=0] [L1045] COND FALSE 1 !(y == 1 && z) VAL [\old(arg)={-1:0}, a={-1:0}, arg={-1:0}, i=1, ind=0, j=2, size=2, x=1, y=1, z=0] [L1047] COND TRUE 1 ind < size - 1 [L1048] 1 ++ind VAL [\old(arg)={-1:0}, a={-1:0}, arg={-1:0}, i=1, ind=1, j=2, size=2, x=1, y=1, z=0] [L1049] 1 a[ind] = i - UnprovableResult [Line: 1067]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1077]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1077]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1077]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1076]: 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: 1075]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 14 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: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=1, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-10 01:15:18,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)