./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test14_1.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/ldv-memsafety/memleaks_test14_1.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 a70da9b875e65dfce1d24d9896f28c8f06f4c5903acb198968ef49c3c899dd06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:54:39,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:54:39,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:54:39,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:54:39,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:54:39,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:54:39,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:54:39,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:54:39,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:54:39,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:54:39,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:54:39,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:54:39,585 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:54:39,586 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:54:39,587 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:54:39,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:54:39,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:54:39,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:54:39,587 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:54:39,587 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:54:39,587 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:54:39,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:54:39,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:54:39,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:54:39,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:54:39,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:54:39,589 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 -> a70da9b875e65dfce1d24d9896f28c8f06f4c5903acb198968ef49c3c899dd06 [2025-03-08 22:54:39,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:54:39,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:54:39,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:54:39,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:54:39,837 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:54:39,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14_1.i [2025-03-08 22:54:40,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c6080f9/a9f3b575b6264e749541feb77e5c10a4/FLAG5b5d423e2 [2025-03-08 22:54:41,287 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:54:41,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_1.i [2025-03-08 22:54:41,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c6080f9/a9f3b575b6264e749541feb77e5c10a4/FLAG5b5d423e2 [2025-03-08 22:54:41,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c6080f9/a9f3b575b6264e749541feb77e5c10a4 [2025-03-08 22:54:41,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:54:41,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:54:41,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:54:41,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:54:41,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:54:41,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:41" (1/1) ... [2025-03-08 22:54:41,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfa5292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:41, skipping insertion in model container [2025-03-08 22:54:41,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:41" (1/1) ... [2025-03-08 22:54:41,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:54:41,761 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:54:41,795 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:54:41,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:54:41,806 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-03-08 22:54:41,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2ffe20c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:41, skipping insertion in model container [2025-03-08 22:54:41,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:54:41,807 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-08 22:54:41,808 INFO L158 Benchmark]: Toolchain (without parser) took 267.23ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 95.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:54:41,808 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:54:41,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.69ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 95.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:54:41,810 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.72ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.69ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 95.2MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/ldv-memsafety/memleaks_test14_1.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 a70da9b875e65dfce1d24d9896f28c8f06f4c5903acb198968ef49c3c899dd06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:54:43,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:54:43,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-08 22:54:43,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:54:43,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:54:43,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:54:43,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:54:43,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:54:43,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:54:43,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:54:43,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:54:43,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:54:43,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:54:43,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:54:43,533 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:54:43,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:54:43,533 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:54:43,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:54:43,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:54:43,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:54:43,533 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:54:43,533 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:54:43,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:54:43,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:54:43,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:54:43,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:54:43,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:54:43,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:54:43,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:54:43,535 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 22:54:43,535 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 22:54:43,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:54:43,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:54:43,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:54:43,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:54:43,536 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 -> a70da9b875e65dfce1d24d9896f28c8f06f4c5903acb198968ef49c3c899dd06 [2025-03-08 22:54:43,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:54:43,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:54:43,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:54:43,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:54:43,795 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:54:43,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14_1.i [2025-03-08 22:54:44,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2acb02ef/997da6cdeaf44aac847b3cd84985d1b8/FLAGbc27fa9cc [2025-03-08 22:54:45,162 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:54:45,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_1.i [2025-03-08 22:54:45,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2acb02ef/997da6cdeaf44aac847b3cd84985d1b8/FLAGbc27fa9cc [2025-03-08 22:54:45,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2acb02ef/997da6cdeaf44aac847b3cd84985d1b8 [2025-03-08 22:54:45,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:54:45,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:54:45,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:54:45,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:54:45,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:54:45,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69950f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45, skipping insertion in model container [2025-03-08 22:54:45,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:54:45,474 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:54:45,504 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:54:45,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:54:45,521 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-08 22:54:45,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:54:45,554 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:54:45,574 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:54:45,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:54:45,586 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:54:45,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:54:45,655 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:54:45,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45 WrapperNode [2025-03-08 22:54:45,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:54:45,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:54:45,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:54:45,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:54:45,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,718 INFO L138 Inliner]: procedures = 167, calls = 74, calls flagged for inlining = 21, calls inlined = 4, statements flattened = 22 [2025-03-08 22:54:45,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:54:45,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:54:45,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:54:45,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:54:45,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,745 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 4 writes are split as follows [0, 4]. [2025-03-08 22:54:45,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:54:45,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:54:45,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:54:45,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:54:45,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (1/1) ... [2025-03-08 22:54:45,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:54:45,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:45,789 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-08 22:54:45,794 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-08 22:54:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-03-08 22:54:45,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-03-08 22:54:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 22:54:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 22:54:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2025-03-08 22:54:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2025-03-08 22:54:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:54:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:54:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:54:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:54:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:54:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:54:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:54:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:54:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:54:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:54:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:54:45,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:54:45,925 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:54:45,927 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:54:46,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2025-03-08 22:54:46,105 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-08 22:54:46,105 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:54:46,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:54:46,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:54:46,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:54:46 BoogieIcfgContainer [2025-03-08 22:54:46,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:54:46,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:54:46,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:54:46,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:54:46,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:54:45" (1/3) ... [2025-03-08 22:54:46,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7523bad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:54:46, skipping insertion in model container [2025-03-08 22:54:46,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:45" (2/3) ... [2025-03-08 22:54:46,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7523bad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:54:46, skipping insertion in model container [2025-03-08 22:54:46,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:54:46" (3/3) ... [2025-03-08 22:54:46,123 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test14_1.i [2025-03-08 22:54:46,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:54:46,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test14_1.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-03-08 22:54:46,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:54:46,179 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;@bed15b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:54:46,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 22:54:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.619047619047619) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:54:46,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:46,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:46,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:46,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1135645554, now seen corresponding path program 1 times [2025-03-08 22:54:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217287705] [2025-03-08 22:54:46,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:46,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:46,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:46,203 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-08 22:54:46,204 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-08 22:54:46,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:54:46,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:54:46,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:46,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:46,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 22:54:46,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:46,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:54:46,414 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-08 22:54:46,465 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-08 22:54:46,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 22:54:46,508 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-08 22:54:46,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:46,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217287705] [2025-03-08 22:54:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217287705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:46,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:46,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:54:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543190648] [2025-03-08 22:54:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:46,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:54:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:46,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:54:46,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2025-03-08 22:54:46,532 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.619047619047619) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:46,715 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2025-03-08 22:54:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:54:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-08 22:54:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:46,721 INFO L225 Difference]: With dead ends: 40 [2025-03-08 22:54:46,721 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 22:54:46,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2025-03-08 22:54:46,724 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:46,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2025-03-08 22:54:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 22:54:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-08 22:54:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.55) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-03-08 22:54:46,746 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 12 [2025-03-08 22:54:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:46,746 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-03-08 22:54:46,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-03-08 22:54:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:54:46,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:46,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:46,754 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-08 22:54:46,947 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-08 22:54:46,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1135645553, now seen corresponding path program 1 times [2025-03-08 22:54:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840770526] [2025-03-08 22:54:46,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:46,951 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-08 22:54:46,951 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-08 22:54:46,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:54:47,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:54:47,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:47,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:47,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 22:54:47,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:47,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:54:47,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:54:47,079 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-08 22:54:47,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:54:47,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:54:47,122 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:47,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 22:54:47,178 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-08 22:54:47,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:47,178 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:47,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840770526] [2025-03-08 22:54:47,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840770526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:47,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:47,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:54:47,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128540059] [2025-03-08 22:54:47,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:47,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:54:47,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:47,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:54:47,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2025-03-08 22:54:47,180 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:47,373 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-03-08 22:54:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:54:47,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-08 22:54:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:47,375 INFO L225 Difference]: With dead ends: 41 [2025-03-08 22:54:47,375 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 22:54:47,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2025-03-08 22:54:47,376 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:47,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 61 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2025-03-08 22:54:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 22:54:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-03-08 22:54:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.5) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-08 22:54:47,380 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 12 [2025-03-08 22:54:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:47,380 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-08 22:54:47,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-08 22:54:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:54:47,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:47,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:47,388 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-08 22:54:47,581 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-08 22:54:47,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:47,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1135625597, now seen corresponding path program 1 times [2025-03-08 22:54:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:47,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361347935] [2025-03-08 22:54:47,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:47,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:47,585 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-08 22:54:47,587 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-08 22:54:47,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:54:47,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:54:47,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:47,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:47,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:54:47,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:47,670 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-08 22:54:47,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:47,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361347935] [2025-03-08 22:54:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361347935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:54:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127640750] [2025-03-08 22:54:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:54:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:47,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:54:47,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:54:47,673 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:47,692 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-03-08 22:54:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:54:47,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-08 22:54:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:47,694 INFO L225 Difference]: With dead ends: 41 [2025-03-08 22:54:47,694 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 22:54:47,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:54:47,694 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:47,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:54:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 22:54:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-08 22:54:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.434782608695652) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:54:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2025-03-08 22:54:47,702 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 12 [2025-03-08 22:54:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:47,702 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2025-03-08 22:54:47,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2025-03-08 22:54:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:54:47,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:47,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:47,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:54:47,908 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-08 22:54:47,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:47,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 607184738, now seen corresponding path program 1 times [2025-03-08 22:54:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987386719] [2025-03-08 22:54:47,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:47,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:47,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:47,911 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-08 22:54:47,911 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-08 22:54:47,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:54:47,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:54:47,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:47,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:47,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:54:47,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:48,021 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#list_14~0#1.base_6|)))) is different from true [2025-03-08 22:54:48,027 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-08 22:54:48,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:48,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:48,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987386719] [2025-03-08 22:54:48,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987386719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:48,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:48,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:54:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986464470] [2025-03-08 22:54:48,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:48,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:54:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:48,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:54:48,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2025-03-08 22:54:48,029 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:48,124 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2025-03-08 22:54:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:54:48,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-08 22:54:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:48,124 INFO L225 Difference]: With dead ends: 43 [2025-03-08 22:54:48,125 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 22:54:48,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2025-03-08 22:54:48,125 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:48,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2025-03-08 22:54:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 22:54:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 22:54:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.391304347826087) internal successors, (32), 32 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:54:48,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2025-03-08 22:54:48,131 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 12 [2025-03-08 22:54:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:48,131 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2025-03-08 22:54:48,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2025-03-08 22:54:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:54:48,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:48,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:48,140 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-08 22:54:48,334 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-08 22:54:48,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:48,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash -559301289, now seen corresponding path program 1 times [2025-03-08 22:54:48,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239393281] [2025-03-08 22:54:48,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:48,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:48,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:48,337 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:48,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:54:48,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:54:48,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:54:48,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:48,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:48,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:54:48,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:52,407 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_alloc_14_~list#1.offset_BEFORE_CALL_3|) |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_5|)) is different from true [2025-03-08 22:54:52,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-08 22:54:52,509 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-08 22:54:52,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:52,509 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:52,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239393281] [2025-03-08 22:54:52,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239393281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:52,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:52,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:54:52,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463490452] [2025-03-08 22:54:52,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:52,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:54:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:52,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:54:52,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2025-03-08 22:54:52,511 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:52,668 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2025-03-08 22:54:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:54:52,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-08 22:54:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:52,669 INFO L225 Difference]: With dead ends: 39 [2025-03-08 22:54:52,669 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 22:54:52,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-03-08 22:54:52,670 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:52,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 96 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2025-03-08 22:54:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 22:54:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 22:54:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 31 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:54:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2025-03-08 22:54:52,675 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 15 [2025-03-08 22:54:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:52,675 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2025-03-08 22:54:52,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2025-03-08 22:54:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:54:52,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:52,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:52,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:54:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:52,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -559301288, now seen corresponding path program 1 times [2025-03-08 22:54:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495898235] [2025-03-08 22:54:52,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:52,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:52,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:52,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:52,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:54:52,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:54:52,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:54:52,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:52,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:52,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:54:52,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:52,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:54:52,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:54:52,992 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 5 treesize of output 3 [2025-03-08 22:54:52,996 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 7 treesize of output 5 [2025-03-08 22:54:53,046 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32))) (= |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_alloc_14_~list#1.base_BEFORE_CALL_7|) (_ bv0 32)))))) is different from true [2025-03-08 22:54:53,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:54:53,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:54:53,097 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:53,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 22:54:53,298 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 22:54:53,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 22:54:53,304 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 22:54:53,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 22:54:53,367 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-08 22:54:53,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:53,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495898235] [2025-03-08 22:54:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495898235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:53,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:54:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788114839] [2025-03-08 22:54:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:53,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:54:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:53,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:54:53,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2025-03-08 22:54:53,370 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:53,842 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2025-03-08 22:54:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:54:53,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-08 22:54:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:53,843 INFO L225 Difference]: With dead ends: 38 [2025-03-08 22:54:53,844 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 22:54:53,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2025-03-08 22:54:53,844 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:53,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 52 Unchecked, 0.3s Time] [2025-03-08 22:54:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 22:54:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 22:54:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 30 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:54:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2025-03-08 22:54:53,848 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 15 [2025-03-08 22:54:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:53,848 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2025-03-08 22:54:53,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2025-03-08 22:54:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:54:53,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:53,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:53,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:54:54,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:54,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:54,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash -158470792, now seen corresponding path program 1 times [2025-03-08 22:54:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:54,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769070682] [2025-03-08 22:54:54,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:54,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:54,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:54,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:54,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:54:54,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:54:54,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:54:54,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:54,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:54,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:54:54,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:54,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:54:54,162 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-08 22:54:54,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:54,162 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:54,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769070682] [2025-03-08 22:54:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769070682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:54,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:54:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427256704] [2025-03-08 22:54:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:54,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:54:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:54,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:54:54,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:54:54,163 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:54,350 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2025-03-08 22:54:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:54:54,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-08 22:54:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:54,351 INFO L225 Difference]: With dead ends: 54 [2025-03-08 22:54:54,351 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 22:54:54,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:54:54,351 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:54,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 82 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:54:54,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 22:54:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2025-03-08 22:54:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 35 states have internal predecessors, (39), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:54:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-03-08 22:54:54,355 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 16 [2025-03-08 22:54:54,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:54,355 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-03-08 22:54:54,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-03-08 22:54:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:54:54,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:54,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:54,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:54:54,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:54,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:54,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash -158470791, now seen corresponding path program 1 times [2025-03-08 22:54:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803132920] [2025-03-08 22:54:54,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:54,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:54,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:54,558 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:54,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:54:54,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:54:54,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:54:54,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:54,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:54,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:54:54,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:54,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:54:54,743 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-08 22:54:54,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:54,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:54,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803132920] [2025-03-08 22:54:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803132920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:54,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:54:54,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42021723] [2025-03-08 22:54:54,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:54,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:54:54,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:54,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:54:54,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:54:54,745 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:54,961 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2025-03-08 22:54:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:54:54,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-08 22:54:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:54,962 INFO L225 Difference]: With dead ends: 47 [2025-03-08 22:54:54,962 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 22:54:54,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:54:54,963 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:54,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 113 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:54:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 22:54:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-08 22:54:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 35 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:54:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2025-03-08 22:54:54,965 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2025-03-08 22:54:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:54,965 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2025-03-08 22:54:54,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2025-03-08 22:54:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:54:54,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:54,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:54,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 22:54:55,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:55,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:55,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash -29388073, now seen corresponding path program 1 times [2025-03-08 22:54:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:55,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779023479] [2025-03-08 22:54:55,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:55,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:55,173 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:55,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:54:55,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:54:55,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:54:55,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:55,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:55,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:54:55,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:55,258 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-08 22:54:55,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:55,258 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779023479] [2025-03-08 22:54:55,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779023479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:55,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:54:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851426274] [2025-03-08 22:54:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:55,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:54:55,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:55,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:54:55,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:54:55,260 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:55,275 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2025-03-08 22:54:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:54:55,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-08 22:54:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:55,276 INFO L225 Difference]: With dead ends: 33 [2025-03-08 22:54:55,276 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 22:54:55,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:54:55,277 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:55,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:54:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 22:54:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 22:54:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2025-03-08 22:54:55,279 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 16 [2025-03-08 22:54:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:55,279 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2025-03-08 22:54:55,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2025-03-08 22:54:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:54:55,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:55,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:55,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:54:55,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:55,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:55,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1966576395, now seen corresponding path program 1 times [2025-03-08 22:54:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:55,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053609442] [2025-03-08 22:54:55,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:55,483 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:55,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:54:55,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:54:55,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:54:55,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:55,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:55,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:54:55,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:55,556 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-08 22:54:55,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:55,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:55,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053609442] [2025-03-08 22:54:55,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053609442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:55,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:55,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:54:55,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668965223] [2025-03-08 22:54:55,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:55,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:54:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:55,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:54:55,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:54:55,557 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:55,614 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2025-03-08 22:54:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:54:55,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-08 22:54:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:55,615 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:54:55,615 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 22:54:55,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:54:55,616 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:55,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 52 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:54:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 22:54:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 22:54:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2025-03-08 22:54:55,617 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 18 [2025-03-08 22:54:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:55,617 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2025-03-08 22:54:55,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2025-03-08 22:54:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:54:55,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:55,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:55,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 22:54:55,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:55,818 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:55,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1966576394, now seen corresponding path program 1 times [2025-03-08 22:54:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136416964] [2025-03-08 22:54:55,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:55,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:55,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:55,821 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:55,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:54:55,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:54:55,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:54:55,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:55,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:55,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 22:54:55,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:55,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2025-03-08 22:54:56,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-08 22:54:56,080 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-08 22:54:56,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:56,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:56,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136416964] [2025-03-08 22:54:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136416964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:56,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:56,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:54:56,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188465500] [2025-03-08 22:54:56,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:56,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:54:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:56,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:54:56,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:54:56,082 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:56,338 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2025-03-08 22:54:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:54:56,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-08 22:54:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:56,339 INFO L225 Difference]: With dead ends: 27 [2025-03-08 22:54:56,339 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 22:54:56,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:54:56,340 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:56,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 114 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:54:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 22:54:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 22:54:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2025-03-08 22:54:56,342 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 18 [2025-03-08 22:54:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:56,342 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2025-03-08 22:54:56,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:54:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2025-03-08 22:54:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:54:56,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:56,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:56,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 22:54:56,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:56,543 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:54:56,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1612160544, now seen corresponding path program 1 times [2025-03-08 22:54:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730864884] [2025-03-08 22:54:56,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:56,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:56,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:56,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:54:56,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:54:56,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:54:56,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:54:56,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:56,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:54:56,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:54:56,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:54:56,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:54:56,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:56,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:54:56,965 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-08 22:54:56,967 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:54:56,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (10 of 11 remaining) [2025-03-08 22:54:56,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-03-08 22:54:56,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-03-08 22:54:56,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2025-03-08 22:54:56,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2025-03-08 22:54:56,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-03-08 22:54:56,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-03-08 22:54:56,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2025-03-08 22:54:56,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-03-08 22:54:56,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-03-08 22:54:56,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 11 remaining) [2025-03-08 22:54:56,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 22:54:57,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:57,172 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:57,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:54:57,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:54:57 BoogieIcfgContainer [2025-03-08 22:54:57,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:54:57,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:54:57,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:54:57,194 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:54:57,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:54:46" (3/4) ... [2025-03-08 22:54:57,196 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 22:54:57,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:54:57,198 INFO L158 Benchmark]: Toolchain (without parser) took 11993.21ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 56.2MB in the beginning and 76.2MB in the end (delta: -20.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2025-03-08 22:54:57,198 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 54.6MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:54:57,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.81ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 28.7MB in the end (delta: 27.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:54:57,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.45ms. Allocated memory is still 83.9MB. Free memory was 28.7MB in the beginning and 56.8MB in the end (delta: -28.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2025-03-08 22:54:57,198 INFO L158 Benchmark]: Boogie Preprocessor took 42.10ms. Allocated memory is still 83.9MB. Free memory was 56.8MB in the beginning and 55.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:54:57,199 INFO L158 Benchmark]: IcfgBuilder took 352.47ms. Allocated memory is still 83.9MB. Free memory was 54.8MB in the beginning and 39.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:54:57,199 INFO L158 Benchmark]: TraceAbstraction took 11075.46ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 39.1MB in the beginning and 77.3MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:54:57,199 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 76.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:54:57,200 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.17ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 54.6MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.81ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 28.7MB in the end (delta: 27.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.45ms. Allocated memory is still 83.9MB. Free memory was 28.7MB in the beginning and 56.8MB in the end (delta: -28.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.10ms. Allocated memory is still 83.9MB. Free memory was 56.8MB in the beginning and 55.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 352.47ms. Allocated memory is still 83.9MB. Free memory was 54.8MB in the beginning and 39.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11075.46ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 39.1MB in the beginning and 77.3MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 76.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 771]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 771. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L772] CALL entry_point() [L768] struct ldv_list_head list_14 = { &(list_14), &(list_14) }; [L768] struct ldv_list_head list_14 = { &(list_14), &(list_14) }; [L768] struct ldv_list_head list_14 = { &(list_14), &(list_14) }; [L769] CALL alloc_14(&list_14) [L762] CALL, EXPR ldv_malloc(sizeof(struct A14)) VAL [\old(size)=12, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L762] RET, EXPR ldv_malloc(sizeof(struct A14)) VAL [ldv_global_msg_list={1:0}, list={4:0}] [L762] struct A14 *p = (struct A14 *)ldv_malloc(sizeof(struct A14)); [L763] COND TRUE \read(*p) VAL [ldv_global_msg_list={1:0}, list={4:0}, p={2:0}] [L764] CALL ldv_list_add(&p->list, list) VAL [\old(head)={4:0}, \old(new)={2:4}, ldv_global_msg_list={1:0}] [L559] EXPR head->next VAL [\old(head)={4:0}, \old(new)={2:4}, head={4:0}, ldv_global_msg_list={1:0}, new={2:4}] [L559] CALL __ldv_list_add(new, head, head->next) VAL [\old(new)={2:4}, \old(next)={4:0}, \old(prev)={4:0}, ldv_global_msg_list={1:0}] [L547] next->prev = new VAL [\old(new)={2:4}, \old(next)={4:0}, \old(prev)={4:0}, ldv_global_msg_list={1:0}, new={2:4}, next={4:0}, prev={4:0}] [L548] new->next = next VAL [\old(new)={2:4}, \old(next)={4:0}, \old(prev)={4:0}, ldv_global_msg_list={1:0}, new={2:4}, prev={4:0}] [L549] new->prev = prev VAL [\old(new)={2:4}, \old(next)={4:0}, \old(prev)={4:0}, ldv_global_msg_list={1:0}, new={2:4}, prev={4:0}] [L550] prev->next = new VAL [\old(new)={2:4}, \old(next)={4:0}, \old(prev)={4:0}, ldv_global_msg_list={1:0}] [L559] RET __ldv_list_add(new, head, head->next) VAL [\old(head)={4:0}, \old(new)={2:4}, head={4:0}, ldv_global_msg_list={1:0}, new={2:4}] [L764] RET ldv_list_add(&p->list, list) VAL [ldv_global_msg_list={1:0}, list={4:0}, p={2:0}] [L769] RET alloc_14(&list_14) [L768] struct ldv_list_head list_14 = { &(list_14), &(list_14) }; VAL [ldv_global_msg_list={1:0}] [L772] RET entry_point() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 43 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 956 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 257 IncrementalHoareTripleChecker+Unchecked, 721 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1049 IncrementalHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 235 mSDtfsCounter, 1049 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 151 ConstructedInterpolants, 23 QuantifiedInterpolants, 1270 SizeOfPredicates, 47 NumberOfNonLiveVariables, 979 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-08 22:54:57,218 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