./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-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/heap-manipulation/bubble_sort_linux-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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:02:41,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:02:41,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:02:41,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:02:41,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:02:41,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:02:41,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:02:41,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:02:41,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:02:41,288 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:02:41,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:02:41,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:02:41,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:02:41,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:02:41,288 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:02:41,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:02:41,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:02:41,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:02:41,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:02:41,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:02:41,290 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:02:41,290 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:02:41,290 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:02:41,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:02:41,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:02:41,291 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:02:41,291 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:02:41,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:02:41,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:02:41,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:02:41,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:02:41,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:02:41,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:02:41,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:02:41,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:02:41,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:02:41,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:02:41,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:02:41,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:02:41,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:02:41,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:02:41,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:02:41,292 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2025-03-08 23:02:41,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:02:41,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:02:41,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:02:41,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:02:41,509 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:02:41,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-03-08 23:02:42,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdbd572d4/45cc12456c5c4c89b09d3ccbac584376/FLAGa8d271e67 [2025-03-08 23:02:43,014 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:02:43,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-03-08 23:02:43,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdbd572d4/45cc12456c5c4c89b09d3ccbac584376/FLAGa8d271e67 [2025-03-08 23:02:43,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdbd572d4/45cc12456c5c4c89b09d3ccbac584376 [2025-03-08 23:02:43,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:02:43,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:02:43,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:02:43,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:02:43,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:02:43,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:43" (1/1) ... [2025-03-08 23:02:43,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b20e29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:43, skipping insertion in model container [2025-03-08 23:02:43,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:43" (1/1) ... [2025-03-08 23:02:43,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:02:43,403 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-08 23:02:43,403 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-08 23:02:43,404 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-08 23:02:43,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:02:43,438 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 23:02:43,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5beb38e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:43, skipping insertion in model container [2025-03-08 23:02:43,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:02:43,439 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-08 23:02:43,441 INFO L158 Benchmark]: Toolchain (without parser) took 389.81ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 90.1MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:02:43,441 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:02:43,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.64ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 90.1MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:02:43,443 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.27ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.64ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 90.1MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: 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/heap-manipulation/bubble_sort_linux-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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:02:45,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:02:45,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-08 23:02:45,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:02:45,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:02:45,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:02:45,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:02:45,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:02:45,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:02:45,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:02:45,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:02:45,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:02:45,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:02:45,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:02:45,164 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:02:45,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:02:45,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:02:45,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:02:45,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:02:45,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:02:45,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:02:45,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:02:45,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:02:45,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:02:45,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:02:45,167 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2025-03-08 23:02:45,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:02:45,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:02:45,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:02:45,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:02:45,422 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:02:45,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-03-08 23:02:46,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a8954d1/5155ae1e0b6f4935a894c08c2394d445/FLAGf43bac1e3 [2025-03-08 23:02:46,792 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:02:46,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-03-08 23:02:46,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a8954d1/5155ae1e0b6f4935a894c08c2394d445/FLAGf43bac1e3 [2025-03-08 23:02:46,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a8954d1/5155ae1e0b6f4935a894c08c2394d445 [2025-03-08 23:02:46,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:02:46,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:02:46,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:02:46,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:02:46,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:02:46,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:46" (1/1) ... [2025-03-08 23:02:46,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408e56d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:46, skipping insertion in model container [2025-03-08 23:02:46,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:02:46" (1/1) ... [2025-03-08 23:02:46,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:02:47,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:02:47,147 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-08 23:02:47,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:02:47,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:02:47,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:02:47,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:02:47,280 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:02:47,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47 WrapperNode [2025-03-08 23:02:47,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:02:47,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:02:47,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:02:47,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:02:47,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,319 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 119 [2025-03-08 23:02:47,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:02:47,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:02:47,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:02:47,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:02:47,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,361 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-03-08 23:02:47,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:02:47,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:02:47,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:02:47,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:02:47,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (1/1) ... [2025-03-08 23:02:47,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:02:47,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:47,406 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 23:02:47,408 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 23:02:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 23:02:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 23:02:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:02:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:02:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-03-08 23:02:47,428 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-03-08 23:02:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:02:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 23:02:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 23:02:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 23:02:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 23:02:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 23:02:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 23:02:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-03-08 23:02:47,429 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-03-08 23:02:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-08 23:02:47,429 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-08 23:02:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:02:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:02:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:02:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:02:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-08 23:02:47,430 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-08 23:02:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:02:47,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:02:47,564 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:02:47,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:02:47,616 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2025-03-08 23:02:48,126 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2025-03-08 23:02:48,127 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:02:48,140 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:02:48,141 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:02:48,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:02:48 BoogieIcfgContainer [2025-03-08 23:02:48,141 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:02:48,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:02:48,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:02:48,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:02:48,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:02:46" (1/3) ... [2025-03-08 23:02:48,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1c60e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:02:48, skipping insertion in model container [2025-03-08 23:02:48,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:02:47" (2/3) ... [2025-03-08 23:02:48,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1c60e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:02:48, skipping insertion in model container [2025-03-08 23:02:48,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:02:48" (3/3) ... [2025-03-08 23:02:48,150 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2025-03-08 23:02:48,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:02:48,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-1.i that has 5 procedures, 218 locations, 1 initial locations, 23 loop locations, and 71 error locations. [2025-03-08 23:02:48,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:02:48,202 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;@75420a5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:02:48,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-08 23:02:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 119 states have (on average 2.142857142857143) internal successors, (255), 208 states have internal predecessors, (255), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 23:02:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:02:48,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:48,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:02:48,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:48,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash 297710325, now seen corresponding path program 1 times [2025-03-08 23:02:48,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:48,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746806583] [2025-03-08 23:02:48,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:48,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:48,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:48,222 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 23:02:48,223 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 23:02:48,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:02:48,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:02:48,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:48,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:48,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 23:02:48,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:48,308 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 23:02:48,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:48,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746806583] [2025-03-08 23:02:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746806583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:48,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:48,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:48,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838145971] [2025-03-08 23:02:48,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:48,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 23:02:48,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:48,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 23:02:48,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:02:48,334 INFO L87 Difference]: Start difference. First operand has 218 states, 119 states have (on average 2.142857142857143) internal successors, (255), 208 states have internal predecessors, (255), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:48,358 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2025-03-08 23:02:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 23:02:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 23:02:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:48,365 INFO L225 Difference]: With dead ends: 213 [2025-03-08 23:02:48,366 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 23:02:48,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:02:48,369 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:48,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:02:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 23:02:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-08 23:02:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.7758620689655173) internal successors, (206), 200 states have internal predecessors, (206), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:02:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2025-03-08 23:02:48,427 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 5 [2025-03-08 23:02:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:48,427 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2025-03-08 23:02:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2025-03-08 23:02:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:02:48,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:48,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:02:48,434 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 23:02:48,628 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 23:02:48,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:48,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash 297710356, now seen corresponding path program 1 times [2025-03-08 23:02:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:48,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347303088] [2025-03-08 23:02:48,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:48,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:48,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:48,634 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 23:02:48,635 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 23:02:48,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:02:48,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:02:48,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:48,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:48,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 23:02:48,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:48,729 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 23:02:48,742 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 23:02:48,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:48,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:48,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347303088] [2025-03-08 23:02:48,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347303088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:48,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:48,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036303906] [2025-03-08 23:02:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:48,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:02:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:48,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:02:48,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:48,743 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:48,930 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2025-03-08 23:02:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:02:48,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 23:02:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:48,932 INFO L225 Difference]: With dead ends: 208 [2025-03-08 23:02:48,932 INFO L226 Difference]: Without dead ends: 208 [2025-03-08 23:02:48,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:48,932 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:48,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 376 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-08 23:02:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-08 23:02:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 116 states have (on average 1.75) internal successors, (203), 197 states have internal predecessors, (203), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:02:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2025-03-08 23:02:48,947 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 5 [2025-03-08 23:02:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:48,947 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2025-03-08 23:02:48,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2025-03-08 23:02:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:02:48,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:48,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:02:48,954 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 23:02:49,147 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 23:02:49,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:49,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash 297710357, now seen corresponding path program 1 times [2025-03-08 23:02:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592092073] [2025-03-08 23:02:49,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:49,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:49,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:49,152 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 23:02:49,153 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 23:02:49,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:02:49,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:02:49,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:49,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:49,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 23:02:49,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:49,206 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 23:02:49,221 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 23:02:49,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:49,221 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:49,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592092073] [2025-03-08 23:02:49,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592092073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:49,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:49,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:02:49,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572006112] [2025-03-08 23:02:49,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:49,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:02:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:49,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:02:49,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:49,223 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:49,403 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2025-03-08 23:02:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:02:49,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 23:02:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:49,406 INFO L225 Difference]: With dead ends: 205 [2025-03-08 23:02:49,406 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 23:02:49,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:02:49,406 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:49,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 380 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 23:02:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-08 23:02:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.7241379310344827) internal successors, (200), 194 states have internal predecessors, (200), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:02:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 227 transitions. [2025-03-08 23:02:49,420 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 227 transitions. Word has length 5 [2025-03-08 23:02:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:49,420 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 227 transitions. [2025-03-08 23:02:49,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 227 transitions. [2025-03-08 23:02:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 23:02:49,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:49,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:49,428 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 23:02:49,620 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 23:02:49,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:49,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash -17959277, now seen corresponding path program 1 times [2025-03-08 23:02:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:49,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672153352] [2025-03-08 23:02:49,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:49,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:49,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:49,624 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 23:02:49,626 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 23:02:49,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 23:02:49,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 23:02:49,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:49,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:49,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 23:02:49,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:49,735 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-08 23:02:49,735 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 23:02:49,792 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 23:02:49,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:49,793 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672153352] [2025-03-08 23:02:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672153352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:49,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:02:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952329655] [2025-03-08 23:02:49,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:49,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:49,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:49,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:49,794 INFO L87 Difference]: Start difference. First operand 205 states and 227 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:50,149 INFO L93 Difference]: Finished difference Result 242 states and 263 transitions. [2025-03-08 23:02:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:02:50,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 23:02:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:50,150 INFO L225 Difference]: With dead ends: 242 [2025-03-08 23:02:50,150 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 23:02:50,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:02:50,151 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 254 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:50,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 400 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:02:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 23:02:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 219. [2025-03-08 23:02:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 130 states have (on average 1.7461538461538462) internal successors, (227), 207 states have internal predecessors, (227), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:02:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2025-03-08 23:02:50,158 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 8 [2025-03-08 23:02:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:50,158 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2025-03-08 23:02:50,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2025-03-08 23:02:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 23:02:50,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:50,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:50,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 23:02:50,359 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 23:02:50,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:50,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash -17959276, now seen corresponding path program 1 times [2025-03-08 23:02:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122570580] [2025-03-08 23:02:50,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:50,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:50,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:50,363 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 23:02:50,364 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 23:02:50,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 23:02:50,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 23:02:50,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:50,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:50,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 23:02:50,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:50,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:02:50,475 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 23:02:50,541 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 23:02:50,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:50,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122570580] [2025-03-08 23:02:50,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122570580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:50,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:50,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:02:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762005974] [2025-03-08 23:02:50,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:50,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:02:50,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:50,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:02:50,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:02:50,542 INFO L87 Difference]: Start difference. First operand 219 states and 254 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:50,966 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2025-03-08 23:02:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:02:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 23:02:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:50,967 INFO L225 Difference]: With dead ends: 223 [2025-03-08 23:02:50,967 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 23:02:50,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:02:50,968 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 253 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:50,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 311 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:02:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 23:02:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2025-03-08 23:02:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 199 states have internal predecessors, (213), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:02:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 240 transitions. [2025-03-08 23:02:50,974 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 240 transitions. Word has length 8 [2025-03-08 23:02:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:50,974 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 240 transitions. [2025-03-08 23:02:50,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 240 transitions. [2025-03-08 23:02:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:02:50,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:50,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:50,983 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 23:02:51,175 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 23:02:51,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -78991152, now seen corresponding path program 1 times [2025-03-08 23:02:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132664509] [2025-03-08 23:02:51,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:51,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:51,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:51,178 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 23:02:51,180 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 23:02:51,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:02:51,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:02:51,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:51,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:51,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 23:02:51,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:51,277 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 23:02:51,277 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 23:02:51,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:02:51,382 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 23:02:51,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:51,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:51,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132664509] [2025-03-08 23:02:51,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132664509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:51,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:51,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:02:51,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832113305] [2025-03-08 23:02:51,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:51,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:02:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:51,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:02:51,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:02:51,383 INFO L87 Difference]: Start difference. First operand 211 states and 240 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:51,841 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2025-03-08 23:02:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:02:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 23:02:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:51,843 INFO L225 Difference]: With dead ends: 223 [2025-03-08 23:02:51,843 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 23:02:51,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:02:51,843 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 13 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:51,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1365 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:02:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 23:02:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2025-03-08 23:02:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 206 states have internal predecessors, (221), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 250 transitions. [2025-03-08 23:02:51,850 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 250 transitions. Word has length 10 [2025-03-08 23:02:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:51,850 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 250 transitions. [2025-03-08 23:02:51,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 250 transitions. [2025-03-08 23:02:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 23:02:51,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:51,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:51,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 23:02:52,055 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 23:02:52,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:52,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:52,055 INFO L85 PathProgramCache]: Analyzing trace with hash -78991151, now seen corresponding path program 1 times [2025-03-08 23:02:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832671009] [2025-03-08 23:02:52,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:52,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:52,058 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 23:02:52,058 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 23:02:52,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 23:02:52,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 23:02:52,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:52,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:52,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 23:02:52,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:52,197 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 23:02:52,197 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 23:02:52,205 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 23:02:52,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:02:52,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:02:52,416 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 23:02:52,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:52,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832671009] [2025-03-08 23:02:52,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832671009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:52,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:52,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:02:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758804488] [2025-03-08 23:02:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:52,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:02:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:52,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:02:52,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:02:52,420 INFO L87 Difference]: Start difference. First operand 219 states and 250 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:52,986 INFO L93 Difference]: Finished difference Result 225 states and 255 transitions. [2025-03-08 23:02:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:52,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 23:02:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:52,988 INFO L225 Difference]: With dead ends: 225 [2025-03-08 23:02:52,988 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 23:02:52,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:02:52,989 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 26 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:52,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 965 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:02:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 23:02:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2025-03-08 23:02:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 206 states have internal predecessors, (220), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 249 transitions. [2025-03-08 23:02:52,994 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 249 transitions. Word has length 10 [2025-03-08 23:02:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:52,995 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 249 transitions. [2025-03-08 23:02:52,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 249 transitions. [2025-03-08 23:02:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 23:02:52,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:52,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:53,002 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 23:02:53,196 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 23:02:53,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:53,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1846241730, now seen corresponding path program 1 times [2025-03-08 23:02:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:53,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641262011] [2025-03-08 23:02:53,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:53,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:53,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:53,199 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 23:02:53,200 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 23:02:53,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 23:02:53,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 23:02:53,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:53,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 23:02:53,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:53,289 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 23:02:53,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:53,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641262011] [2025-03-08 23:02:53,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641262011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:53,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:02:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106527571] [2025-03-08 23:02:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:53,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:02:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:53,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:02:53,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:02:53,291 INFO L87 Difference]: Start difference. First operand 219 states and 249 transitions. Second operand has 6 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:53,570 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2025-03-08 23:02:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:02:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 23:02:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:53,572 INFO L225 Difference]: With dead ends: 224 [2025-03-08 23:02:53,572 INFO L226 Difference]: Without dead ends: 224 [2025-03-08 23:02:53,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:02:53,572 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 28 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:53,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 794 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:02:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-08 23:02:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2025-03-08 23:02:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.631578947368421) internal successors, (217), 205 states have internal predecessors, (217), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 246 transitions. [2025-03-08 23:02:53,577 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 246 transitions. Word has length 11 [2025-03-08 23:02:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:53,577 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 246 transitions. [2025-03-08 23:02:53,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 246 transitions. [2025-03-08 23:02:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 23:02:53,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:53,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:53,584 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 23:02:53,778 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 23:02:53,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1846241731, now seen corresponding path program 1 times [2025-03-08 23:02:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:53,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759244336] [2025-03-08 23:02:53,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:53,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:53,781 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 23:02:53,781 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 23:02:53,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 23:02:53,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 23:02:53,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:53,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:53,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 23:02:53,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:53,846 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 23:02:53,896 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 23:02:53,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:53,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:53,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759244336] [2025-03-08 23:02:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759244336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:53,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:53,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:02:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357548934] [2025-03-08 23:02:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:53,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:02:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:53,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:02:53,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:02:53,897 INFO L87 Difference]: Start difference. First operand 218 states and 246 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:54,234 INFO L93 Difference]: Finished difference Result 222 states and 244 transitions. [2025-03-08 23:02:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:02:54,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 23:02:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:54,236 INFO L225 Difference]: With dead ends: 222 [2025-03-08 23:02:54,236 INFO L226 Difference]: Without dead ends: 222 [2025-03-08 23:02:54,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:02:54,236 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 22 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:54,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 819 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:02:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-08 23:02:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2025-03-08 23:02:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.6165413533834587) internal successors, (215), 205 states have internal predecessors, (215), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 244 transitions. [2025-03-08 23:02:54,241 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 244 transitions. Word has length 11 [2025-03-08 23:02:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:54,242 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 244 transitions. [2025-03-08 23:02:54,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 244 transitions. [2025-03-08 23:02:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 23:02:54,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:54,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:54,249 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 23:02:54,443 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 23:02:54,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash 416813855, now seen corresponding path program 1 times [2025-03-08 23:02:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564791103] [2025-03-08 23:02:54,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:54,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:54,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:54,449 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 23:02:54,450 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 23:02:54,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 23:02:54,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 23:02:54,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:54,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:54,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 23:02:54,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:54,535 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 23:02:54,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:54,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:54,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564791103] [2025-03-08 23:02:54,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564791103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:54,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:02:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461635188] [2025-03-08 23:02:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:02:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:54,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:02:54,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:02:54,537 INFO L87 Difference]: Start difference. First operand 218 states and 244 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:54,699 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2025-03-08 23:02:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:02:54,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 23:02:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:54,701 INFO L225 Difference]: With dead ends: 217 [2025-03-08 23:02:54,701 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 23:02:54,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:02:54,701 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 5 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:54,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 512 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 23:02:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-08 23:02:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 133 states have (on average 1.6015037593984962) internal successors, (213), 204 states have internal predecessors, (213), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 242 transitions. [2025-03-08 23:02:54,706 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 242 transitions. Word has length 13 [2025-03-08 23:02:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:54,706 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 242 transitions. [2025-03-08 23:02:54,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 242 transitions. [2025-03-08 23:02:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 23:02:54,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:54,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:54,714 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 23:02:54,912 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 23:02:54,912 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:54,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash 416813856, now seen corresponding path program 1 times [2025-03-08 23:02:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:54,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057612335] [2025-03-08 23:02:54,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:54,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:54,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:54,914 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 23:02:54,915 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 23:02:54,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 23:02:54,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 23:02:54,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:54,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:54,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 23:02:54,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:55,050 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 23:02:55,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:55,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:55,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057612335] [2025-03-08 23:02:55,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057612335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:55,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:55,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:02:55,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075935405] [2025-03-08 23:02:55,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:55,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:02:55,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:55,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:02:55,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:02:55,051 INFO L87 Difference]: Start difference. First operand 217 states and 242 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:55,330 INFO L93 Difference]: Finished difference Result 219 states and 241 transitions. [2025-03-08 23:02:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:02:55,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 23:02:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:55,332 INFO L225 Difference]: With dead ends: 219 [2025-03-08 23:02:55,332 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 23:02:55,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:02:55,332 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 238 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:55,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 895 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:02:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 23:02:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2025-03-08 23:02:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 133 states have (on average 1.593984962406015) internal successors, (212), 204 states have internal predecessors, (212), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 241 transitions. [2025-03-08 23:02:55,352 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 241 transitions. Word has length 13 [2025-03-08 23:02:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:55,352 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 241 transitions. [2025-03-08 23:02:55,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:02:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 241 transitions. [2025-03-08 23:02:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:02:55,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:55,353 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, 1] [2025-03-08 23:02:55,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 23:02:55,553 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 23:02:55,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting inspectErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:55,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:55,554 INFO L85 PathProgramCache]: Analyzing trace with hash 892798446, now seen corresponding path program 1 times [2025-03-08 23:02:55,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:55,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188615523] [2025-03-08 23:02:55,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:55,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:55,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:55,556 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 23:02:55,557 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 23:02:55,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:02:55,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:02:55,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:55,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:55,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 23:02:55,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:55,688 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 23:02:55,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:55,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188615523] [2025-03-08 23:02:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188615523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:55,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:55,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:02:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898619400] [2025-03-08 23:02:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:55,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:02:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:55,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:02:55,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:02:55,690 INFO L87 Difference]: Start difference. First operand 217 states and 241 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 23:02:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:56,093 INFO L93 Difference]: Finished difference Result 212 states and 236 transitions. [2025-03-08 23:02:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:56,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 27 [2025-03-08 23:02:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:56,095 INFO L225 Difference]: With dead ends: 212 [2025-03-08 23:02:56,095 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 23:02:56,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:02:56,095 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 363 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:56,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 435 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:02:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 23:02:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-08 23:02:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 133 states have (on average 1.556390977443609) internal successors, (207), 199 states have internal predecessors, (207), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 236 transitions. [2025-03-08 23:02:56,099 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 236 transitions. Word has length 27 [2025-03-08 23:02:56,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:56,100 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 236 transitions. [2025-03-08 23:02:56,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 23:02:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 236 transitions. [2025-03-08 23:02:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:02:56,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:56,100 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, 1] [2025-03-08 23:02:56,107 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 23:02:56,300 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 23:02:56,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting inspectErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:56,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash 892798447, now seen corresponding path program 1 times [2025-03-08 23:02:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880043273] [2025-03-08 23:02:56,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:56,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:56,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:56,303 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:02:56,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 23:02:56,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:02:56,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:02:56,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:56,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:56,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 23:02:56,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:56,531 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 23:02:56,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:56,531 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880043273] [2025-03-08 23:02:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880043273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:56,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:02:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979637228] [2025-03-08 23:02:56,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:56,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:02:56,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:56,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:02:56,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:02:56,532 INFO L87 Difference]: Start difference. First operand 212 states and 236 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 23:02:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:57,089 INFO L93 Difference]: Finished difference Result 211 states and 235 transitions. [2025-03-08 23:02:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:02:57,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 27 [2025-03-08 23:02:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:57,090 INFO L225 Difference]: With dead ends: 211 [2025-03-08 23:02:57,091 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 23:02:57,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:02:57,091 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 303 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:57,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 490 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 23:02:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 23:02:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-08 23:02:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 198 states have internal predecessors, (206), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions. [2025-03-08 23:02:57,097 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 27 [2025-03-08 23:02:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:57,097 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions. [2025-03-08 23:02:57,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 23:02:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions. [2025-03-08 23:02:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:02:57,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:57,099 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, 1, 1, 1] [2025-03-08 23:02:57,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 23:02:57,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:57,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:57,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1010628257, now seen corresponding path program 1 times [2025-03-08 23:02:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:57,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300099863] [2025-03-08 23:02:57,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:57,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:57,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:57,306 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:02:57,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 23:02:57,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:02:57,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:02:57,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:57,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:57,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 23:02:57,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:57,432 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 23:02:57,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:02:57,432 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300099863] [2025-03-08 23:02:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300099863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:02:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:02:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:02:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617440779] [2025-03-08 23:02:57,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:02:57,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:02:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:02:57,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:02:57,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:02:57,433 INFO L87 Difference]: Start difference. First operand 211 states and 235 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 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 23:02:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:02:57,545 INFO L93 Difference]: Finished difference Result 210 states and 233 transitions. [2025-03-08 23:02:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:02:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 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 29 [2025-03-08 23:02:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:02:57,547 INFO L225 Difference]: With dead ends: 210 [2025-03-08 23:02:57,547 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 23:02:57,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:02:57,547 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 279 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:02:57,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 447 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:02:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 23:02:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-03-08 23:02:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 133 states have (on average 1.5413533834586466) internal successors, (205), 197 states have internal predecessors, (205), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:02:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 233 transitions. [2025-03-08 23:02:57,552 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 233 transitions. Word has length 29 [2025-03-08 23:02:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:02:57,553 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 233 transitions. [2025-03-08 23:02:57,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 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 23:02:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 233 transitions. [2025-03-08 23:02:57,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:02:57,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:02:57,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:02:57,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 23:02:57,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:57,754 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:02:57,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:02:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1183913247, now seen corresponding path program 1 times [2025-03-08 23:02:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:02:57,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489194493] [2025-03-08 23:02:57,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:57,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:02:57,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:02:57,757 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:02:57,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 23:02:57,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:02:57,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:02:57,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:57,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:57,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 23:02:57,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:57,909 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 23:02:57,909 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 19 treesize of output 27 [2025-03-08 23:02:58,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-03-08 23:02:58,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:02:58,365 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:02:58,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-08 23:02:58,497 INFO L349 Elim1Store]: treesize reduction 98, result has 30.0 percent of original size [2025-03-08 23:02:58,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 60 [2025-03-08 23:02:58,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-08 23:02:58,727 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 27 treesize of output 15 [2025-03-08 23:02:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:02:58,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:02:58,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (_ BitVec 1)) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_17| (_ BitVec 32)) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_17|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_17| v_ArrVal_434) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_17| v_ArrVal_435) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) is different from false [2025-03-08 23:02:59,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:02:59,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-08 23:02:59,155 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:02:59,157 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 44 treesize of output 36 [2025-03-08 23:02:59,161 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 16 treesize of output 14 [2025-03-08 23:02:59,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:02:59,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489194493] [2025-03-08 23:02:59,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489194493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:02:59,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2022786447] [2025-03-08 23:02:59,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:02:59,297 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 23:02:59,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 23:02:59,320 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 23:02:59,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-08 23:02:59,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:02:59,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:02:59,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:02:59,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:02:59,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 23:02:59,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:02:59,654 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 23:02:59,655 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 19 treesize of output 27 [2025-03-08 23:03:00,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-03-08 23:03:00,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:03:00,278 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:03:00,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-08 23:03:00,411 INFO L349 Elim1Store]: treesize reduction 98, result has 30.0 percent of original size [2025-03-08 23:03:00,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 60 [2025-03-08 23:03:00,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-08 23:03:00,705 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 27 treesize of output 15 [2025-03-08 23:03:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:00,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:00,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_514) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2025-03-08 23:03:08,863 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_513 (_ BitVec 1)) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_21| (_ BitVec 32)) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_21| v_ArrVal_513) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_512) |v_ULTIMATE.start_gl_insert_~node~1#1.base_21| v_ArrVal_514) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_21|))))) is different from false [2025-03-08 23:03:08,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:08,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-08 23:03:08,946 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:08,947 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 44 treesize of output 36 [2025-03-08 23:03:08,950 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 16 treesize of output 14 [2025-03-08 23:03:09,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2022786447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:09,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:03:09,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2025-03-08 23:03:09,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691353197] [2025-03-08 23:03:09,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:09,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 23:03:09,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:03:09,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 23:03:09,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1135, Unknown=27, NotChecked=216, Total=1560 [2025-03-08 23:03:09,049 INFO L87 Difference]: Start difference. First operand 210 states and 233 transitions. Second operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:03:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:03:12,249 INFO L93 Difference]: Finished difference Result 374 states and 413 transitions. [2025-03-08 23:03:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 23:03:12,249 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-08 23:03:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:03:12,250 INFO L225 Difference]: With dead ends: 374 [2025-03-08 23:03:12,250 INFO L226 Difference]: Without dead ends: 374 [2025-03-08 23:03:12,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=292, Invalid=1499, Unknown=27, NotChecked=252, Total=2070 [2025-03-08 23:03:12,251 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 662 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:03:12,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 2145 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 23:03:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-08 23:03:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 288. [2025-03-08 23:03:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 206 states have (on average 1.5679611650485437) internal successors, (323), 271 states have internal predecessors, (323), 24 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 23:03:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 357 transitions. [2025-03-08 23:03:12,257 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 357 transitions. Word has length 29 [2025-03-08 23:03:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:03:12,258 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 357 transitions. [2025-03-08 23:03:12,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:03:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 357 transitions. [2025-03-08 23:03:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:03:12,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:03:12,259 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:03:12,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-08 23:03:12,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 23:03:12,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:12,660 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:03:12,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:03:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1183913246, now seen corresponding path program 1 times [2025-03-08 23:03:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:03:12,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733390877] [2025-03-08 23:03:12,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:12,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:03:12,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:03:12,662 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:03:12,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 23:03:12,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:03:12,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:03:12,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:12,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:12,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 23:03:12,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:12,802 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 23:03:12,811 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 23:03:12,811 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 23:03:13,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-03-08 23:03:13,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-03-08 23:03:13,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:03:13,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:03:13,298 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:03:13,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2025-03-08 23:03:13,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2025-03-08 23:03:13,472 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2025-03-08 23:03:13,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2025-03-08 23:03:13,480 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:03:13,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 23:03:13,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 23:03:13,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:03:13,695 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 25 treesize of output 13 [2025-03-08 23:03:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:13,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:15,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:15,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2025-03-08 23:03:15,700 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:15,704 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 84 treesize of output 76 [2025-03-08 23:03:15,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:15,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 62 [2025-03-08 23:03:15,726 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:15,730 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 96 treesize of output 84 [2025-03-08 23:03:15,740 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 18 treesize of output 16 [2025-03-08 23:03:15,748 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 16 treesize of output 14 [2025-03-08 23:03:15,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:15,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2025-03-08 23:03:15,892 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:15,895 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 46 treesize of output 34 [2025-03-08 23:03:16,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:03:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733390877] [2025-03-08 23:03:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733390877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1528539878] [2025-03-08 23:03:16,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:03:16,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 23:03:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 23:03:16,177 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 23:03:16,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-03-08 23:03:16,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:03:16,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:03:16,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:03:16,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:03:16,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 23:03:16,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:03:16,702 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 23:03:16,767 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 23:03:16,768 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 19 treesize of output 27 [2025-03-08 23:03:17,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-03-08 23:03:17,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-03-08 23:03:18,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:03:18,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2025-03-08 23:03:18,506 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:03:18,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2025-03-08 23:03:18,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2025-03-08 23:03:18,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:03:18,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:03:18,859 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:03:18,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 23:03:18,905 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2025-03-08 23:03:18,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2025-03-08 23:03:19,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:03:19,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 23:03:19,622 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 25 treesize of output 13 [2025-03-08 23:03:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:03:19,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:03:19,796 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_686) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_687) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_686) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2025-03-08 23:03:31,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:31,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2025-03-08 23:03:31,099 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:31,117 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 46 treesize of output 34 [2025-03-08 23:03:31,266 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 11 treesize of output 7 [2025-03-08 23:03:31,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:31,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2025-03-08 23:03:31,421 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:31,439 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 84 treesize of output 76 [2025-03-08 23:03:31,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:03:31,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 62 [2025-03-08 23:03:31,548 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:03:31,567 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 96 treesize of output 84 [2025-03-08 23:03:31,611 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 18 treesize of output 16 [2025-03-08 23:03:31,652 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 16 treesize of output 14 [2025-03-08 23:03:33,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1528539878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:03:33,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:03:33,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2025-03-08 23:03:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080874983] [2025-03-08 23:03:33,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:03:33,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 23:03:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:03:33,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 23:03:33,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1433, Unknown=33, NotChecked=78, Total=1722 [2025-03-08 23:03:33,330 INFO L87 Difference]: Start difference. First operand 288 states and 357 transitions. Second operand has 31 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:04:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:18,432 INFO L93 Difference]: Finished difference Result 373 states and 412 transitions. [2025-03-08 23:04:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 23:04:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-08 23:04:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:18,434 INFO L225 Difference]: With dead ends: 373 [2025-03-08 23:04:18,434 INFO L226 Difference]: Without dead ends: 373 [2025-03-08 23:04:18,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=319, Invalid=1908, Unknown=33, NotChecked=92, Total=2352 [2025-03-08 23:04:18,435 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1408 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:18,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 1551 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 38.4s Time] [2025-03-08 23:04:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-08 23:04:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 280. [2025-03-08 23:04:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 199 states have (on average 1.5829145728643217) internal successors, (315), 264 states have internal predecessors, (315), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 23:04:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 347 transitions. [2025-03-08 23:04:18,442 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 347 transitions. Word has length 29 [2025-03-08 23:04:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:18,443 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 347 transitions. [2025-03-08 23:04:18,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:04:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 347 transitions. [2025-03-08 23:04:18,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:04:18,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:18,445 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, 1, 1, 1, 1] [2025-03-08 23:04:18,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-03-08 23:04:18,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 23:04:18,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:18,846 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting inspectErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-08 23:04:18,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1373834324, now seen corresponding path program 1 times [2025-03-08 23:04:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:04:18,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35235023] [2025-03-08 23:04:18,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:18,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:18,848 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:18,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 23:04:18,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:04:18,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:04:18,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:18,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:18,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 23:04:18,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:19,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:19,477 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 23:04:22,923 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 23:04:22,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:04:22,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:04:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35235023] [2025-03-08 23:04:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35235023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:22,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:22,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:04:22,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809583904] [2025-03-08 23:04:22,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:04:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:04:22,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:04:22,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:04:22,924 INFO L87 Difference]: Start difference. First operand 280 states and 347 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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)