./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0134.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/memsafety/test-0134.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0134.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:26:22,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:26:22,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:26:22,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:26:22,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:26:22,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:26:22,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:26:22,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:26:22,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:26:22,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:26:22,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:26:22,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:26:22,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:26:22,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:26:22,225 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:26:22,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:26:22,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:26:22,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:26:22,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:26:22,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:26:22,225 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:26:22,225 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:26:22,226 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:26:22,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:26:22,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:26:22,226 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:26:22,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:26:22,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:26:22,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:26:22,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:26:22,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:26:22,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:26:22,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:26:22,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:26:22,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:26:22,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:26:22,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:26:22,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:26:22,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:26:22,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:26:22,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:26:22,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:26:22,228 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c [2024-11-07 16:26:22,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:26:22,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:26:22,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:26:22,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:26:22,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:26:22,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0134.i [2024-11-07 16:26:23,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:26:24,098 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:26:24,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0134.i [2024-11-07 16:26:24,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/722d7f0ae/71dcbf4f3a6b45b88a3ae0acd2e14038/FLAGa5b5cdfe1 [2024-11-07 16:26:24,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/722d7f0ae/71dcbf4f3a6b45b88a3ae0acd2e14038 [2024-11-07 16:26:24,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:26:24,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:26:24,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:26:24,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:26:24,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:26:24,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:24" (1/1) ... [2024-11-07 16:26:24,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c67dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:24, skipping insertion in model container [2024-11-07 16:26:24,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:24" (1/1) ... [2024-11-07 16:26:24,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:26:24,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:26:24,434 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) [2024-11-07 16:26:24,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@18cf6048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:24, skipping insertion in model container [2024-11-07 16:26:24,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:26:24,436 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 16:26:24,438 INFO L158 Benchmark]: Toolchain (without parser) took 302.18ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 77.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:26:24,438 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:26:24,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.10ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 77.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:26:24,439 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.87ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.10ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 77.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 585]: 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0134.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:26:26,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:26:26,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 16:26:26,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:26:26,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:26:26,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:26:26,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:26:26,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:26:26,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:26:26,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:26:26,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:26:26,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:26:26,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:26:26,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:26:26,612 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:26:26,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:26:26,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:26:26,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:26:26,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:26:26,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:26:26,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:26:26,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:26:26,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:26:26,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:26:26,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:26:26,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:26:26,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:26:26,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:26:26,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:26:26,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:26:26,616 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:26:26,616 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:26:26,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:26:26,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:26:26,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:26:26,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:26:26,616 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 554aa7448188134a862651a68c0992659f18748881f2b6912b6dbf17d440798c [2024-11-07 16:26:26,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:26:26,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:26:26,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:26:26,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:26:26,907 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:26:26,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0134.i [2024-11-07 16:26:28,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:26:28,520 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:26:28,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0134.i [2024-11-07 16:26:28,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e46b66c/9a4ac6cae040495e91fee12e63bead36/FLAGd2066edbf [2024-11-07 16:26:28,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43e46b66c/9a4ac6cae040495e91fee12e63bead36 [2024-11-07 16:26:28,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:26:28,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:26:28,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:26:28,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:26:28,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:26:28,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:28" (1/1) ... [2024-11-07 16:26:28,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f99ce9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28, skipping insertion in model container [2024-11-07 16:26:28,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:28" (1/1) ... [2024-11-07 16:26:28,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:26:28,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:26:28,961 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 16:26:28,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:26:29,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:26:29,026 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:26:29,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:26:29,129 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:26:29,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29 WrapperNode [2024-11-07 16:26:29,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:26:29,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:26:29,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:26:29,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:26:29,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,177 INFO L138 Inliner]: procedures = 140, calls = 54, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 135 [2024-11-07 16:26:29,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:26:29,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:26:29,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:26:29,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:26:29,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,211 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 10 writes are split as follows [0, 10]. [2024-11-07 16:26:29,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:26:29,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:26:29,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:26:29,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:26:29,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (1/1) ... [2024-11-07 16:26:29,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:26:29,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:26:29,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:26:29,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:26:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2024-11-07 16:26:29,294 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2024-11-07 16:26:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 16:26:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 16:26:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2024-11-07 16:26:29,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2024-11-07 16:26:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:26:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:26:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:26:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:26:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:26:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:26:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:26:29,295 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-07 16:26:29,296 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-07 16:26:29,296 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-07 16:26:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:26:29,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:26:29,432 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:26:29,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:26:29,971 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-07 16:26:29,971 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:26:29,986 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:26:29,986 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 16:26:29,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:29 BoogieIcfgContainer [2024-11-07 16:26:29,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:26:29,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:26:29,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:26:29,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:26:29,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:26:28" (1/3) ... [2024-11-07 16:26:29,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e5d667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:26:29, skipping insertion in model container [2024-11-07 16:26:29,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:29" (2/3) ... [2024-11-07 16:26:29,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e5d667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:26:29, skipping insertion in model container [2024-11-07 16:26:29,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:29" (3/3) ... [2024-11-07 16:26:29,995 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0134.i [2024-11-07 16:26:30,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:26:30,006 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-11-07 16:26:30,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:26:30,057 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;@a9a19c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:26:30,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2024-11-07 16:26:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 118 states have internal predecessors, (130), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 16:26:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:26:30,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:30,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:26:30,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:30,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash 66866992, now seen corresponding path program 1 times [2024-11-07 16:26:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:30,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151004443] [2024-11-07 16:26:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:30,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:30,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:30,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:30,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 16:26:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:30,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 16:26:30,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:30,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:30,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151004443] [2024-11-07 16:26:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151004443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:30,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:30,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:26:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739904804] [2024-11-07 16:26:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:30,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:26:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:26:30,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:26:30,237 INFO L87 Difference]: Start difference. First operand has 132 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 118 states have internal predecessors, (130), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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) [2024-11-07 16:26:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:30,255 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-07 16:26:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:26:30,258 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 [2024-11-07 16:26:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:30,264 INFO L225 Difference]: With dead ends: 132 [2024-11-07 16:26:30,264 INFO L226 Difference]: Without dead ends: 130 [2024-11-07 16:26:30,266 INFO L431 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 [2024-11-07 16:26:30,268 INFO L432 NwaCegarLoop]: 143 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, 143 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 [2024-11-07 16:26:30,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:26:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-07 16:26:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-07 16:26:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 69 states have (on average 1.7826086956521738) internal successors, (123), 116 states have internal predecessors, (123), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 16:26:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2024-11-07 16:26:30,304 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 5 [2024-11-07 16:26:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:30,305 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2024-11-07 16:26:30,305 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) [2024-11-07 16:26:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2024-11-07 16:26:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:26:30,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:30,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:26:30,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 16:26:30,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:30,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:30,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash 66867054, now seen corresponding path program 1 times [2024-11-07 16:26:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128960977] [2024-11-07 16:26:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:30,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:30,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 16:26:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:30,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:26:30,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:30,600 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 [2024-11-07 16:26:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:30,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:30,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:30,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128960977] [2024-11-07 16:26:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128960977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:30,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:30,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:26:30,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440503484] [2024-11-07 16:26:30,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:30,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:26:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:26:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:26:30,623 INFO L87 Difference]: Start difference. First operand 130 states and 141 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) [2024-11-07 16:26:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:30,806 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2024-11-07 16:26:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:26:30,806 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 [2024-11-07 16:26:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:30,807 INFO L225 Difference]: With dead ends: 129 [2024-11-07 16:26:30,809 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 16:26:30,810 INFO L431 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 [2024-11-07 16:26:30,810 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:30,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:26:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 16:26:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-07 16:26:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 115 states have internal predecessors, (122), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 16:26:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2024-11-07 16:26:30,823 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 5 [2024-11-07 16:26:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:30,824 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2024-11-07 16:26:30,824 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) [2024-11-07 16:26:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2024-11-07 16:26:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 16:26:30,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:30,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 16:26:30,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 16:26:31,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:31,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:31,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash 66867055, now seen corresponding path program 1 times [2024-11-07 16:26:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815416871] [2024-11-07 16:26:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:31,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:31,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:31,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:31,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 16:26:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:31,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:26:31,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:31,099 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 [2024-11-07 16:26:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:31,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:31,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:31,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815416871] [2024-11-07 16:26:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815416871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:31,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:26:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470411666] [2024-11-07 16:26:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:26:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:31,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:26:31,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:26:31,120 INFO L87 Difference]: Start difference. First operand 129 states and 140 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) [2024-11-07 16:26:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:31,293 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2024-11-07 16:26:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:26:31,294 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 [2024-11-07 16:26:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:31,295 INFO L225 Difference]: With dead ends: 128 [2024-11-07 16:26:31,295 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 16:26:31,295 INFO L431 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 [2024-11-07 16:26:31,296 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:31,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:26:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 16:26:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-07 16:26:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 114 states have internal predecessors, (121), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 16:26:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-11-07 16:26:31,316 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 5 [2024-11-07 16:26:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:31,317 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-11-07 16:26:31,317 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) [2024-11-07 16:26:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-11-07 16:26:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:26:31,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:31,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:31,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 16:26:31,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:31,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:31,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -828260423, now seen corresponding path program 1 times [2024-11-07 16:26:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658556618] [2024-11-07 16:26:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:31,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:31,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:31,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:31,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 16:26:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:31,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:26:31,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:31,660 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 16:26:31,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-07 16:26:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:31,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:31,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:31,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658556618] [2024-11-07 16:26:31,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658556618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:31,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:31,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:26:31,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854941021] [2024-11-07 16:26:31,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:31,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:26:31,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:26:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:26:31,729 INFO L87 Difference]: Start difference. First operand 128 states and 139 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) [2024-11-07 16:26:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:32,160 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2024-11-07 16:26:32,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:26:32,161 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 [2024-11-07 16:26:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:32,162 INFO L225 Difference]: With dead ends: 166 [2024-11-07 16:26:32,162 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 16:26:32,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:26:32,163 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 164 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:32,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 208 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:26:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 16:26:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143. [2024-11-07 16:26:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 128 states have internal predecessors, (149), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 16:26:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2024-11-07 16:26:32,172 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 8 [2024-11-07 16:26:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:32,172 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2024-11-07 16:26:32,173 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) [2024-11-07 16:26:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2024-11-07 16:26:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:26:32,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:32,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:32,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 16:26:32,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:32,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:32,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:32,377 INFO L85 PathProgramCache]: Analyzing trace with hash -828260422, now seen corresponding path program 1 times [2024-11-07 16:26:32,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:32,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164665314] [2024-11-07 16:26:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:32,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:32,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:32,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:32,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 16:26:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:32,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 16:26:32,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:32,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:26:32,545 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 [2024-11-07 16:26:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:32,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:32,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:32,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164665314] [2024-11-07 16:26:32,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164665314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:32,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:32,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:26:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421878587] [2024-11-07 16:26:32,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:26:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:32,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:26:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:26:32,649 INFO L87 Difference]: Start difference. First operand 143 states and 167 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) [2024-11-07 16:26:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:33,099 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2024-11-07 16:26:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:26:33,100 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 [2024-11-07 16:26:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:33,101 INFO L225 Difference]: With dead ends: 147 [2024-11-07 16:26:33,101 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 16:26:33,101 INFO L431 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 [2024-11-07 16:26:33,102 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 165 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:33,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 146 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:26:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 16:26:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2024-11-07 16:26:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.6875) internal successors, (135), 120 states have internal predecessors, (135), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 16:26:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2024-11-07 16:26:33,111 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 8 [2024-11-07 16:26:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:33,111 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2024-11-07 16:26:33,111 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) [2024-11-07 16:26:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2024-11-07 16:26:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:26:33,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:33,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:33,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-07 16:26:33,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:33,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1389316934, now seen corresponding path program 1 times [2024-11-07 16:26:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:33,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446068955] [2024-11-07 16:26:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:33,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:33,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:33,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:33,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 16:26:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:33,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 16:26:33,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:33,490 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-07 16:26:33,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-11-07 16:26:33,530 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 [2024-11-07 16:26:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:33,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:33,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446068955] [2024-11-07 16:26:33,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446068955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:33,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:33,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:26:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897161829] [2024-11-07 16:26:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:33,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:26:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:33,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:26:33,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:26:33,634 INFO L87 Difference]: Start difference. First operand 135 states and 153 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) [2024-11-07 16:26:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:34,152 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2024-11-07 16:26:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:26:34,152 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 [2024-11-07 16:26:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:34,154 INFO L225 Difference]: With dead ends: 147 [2024-11-07 16:26:34,154 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 16:26:34,155 INFO L431 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 [2024-11-07 16:26:34,155 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 17 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:34,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 582 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:26:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 16:26:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2024-11-07 16:26:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 127 states have internal predecessors, (143), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:26:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2024-11-07 16:26:34,162 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 10 [2024-11-07 16:26:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:34,165 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2024-11-07 16:26:34,165 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) [2024-11-07 16:26:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2024-11-07 16:26:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:26:34,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:34,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:34,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 16:26:34,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:34,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:34,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1389316933, now seen corresponding path program 1 times [2024-11-07 16:26:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016006714] [2024-11-07 16:26:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:34,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:34,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:34,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:34,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 16:26:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:34,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 16:26:34,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:34,582 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-07 16:26:34,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-07 16:26:34,605 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:26:34,605 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 [2024-11-07 16:26:34,677 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 [2024-11-07 16:26:34,685 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 [2024-11-07 16:26:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:34,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:34,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016006714] [2024-11-07 16:26:34,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016006714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:34,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:34,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:26:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643657636] [2024-11-07 16:26:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:34,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:26:34,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:26:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:26:34,866 INFO L87 Difference]: Start difference. First operand 143 states and 163 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) [2024-11-07 16:26:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:35,591 INFO L93 Difference]: Finished difference Result 149 states and 168 transitions. [2024-11-07 16:26:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:26:35,592 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 [2024-11-07 16:26:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:35,593 INFO L225 Difference]: With dead ends: 149 [2024-11-07 16:26:35,593 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 16:26:35,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:26:35,594 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 26 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:35,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 604 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:26:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 16:26:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2024-11-07 16:26:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 87 states have (on average 1.632183908045977) internal successors, (142), 127 states have internal predecessors, (142), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:26:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2024-11-07 16:26:35,608 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 10 [2024-11-07 16:26:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:35,608 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2024-11-07 16:26:35,608 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) [2024-11-07 16:26:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2024-11-07 16:26:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:26:35,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:35,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:35,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 16:26:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:35,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:35,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash -119151996, now seen corresponding path program 1 times [2024-11-07 16:26:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239212591] [2024-11-07 16:26:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:35,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:35,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:35,814 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:35,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 16:26:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:35,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:26:35,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:35,901 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 [2024-11-07 16:26:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:35,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:35,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:35,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239212591] [2024-11-07 16:26:35,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239212591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:35,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:35,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:26:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197701352] [2024-11-07 16:26:35,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:35,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:26:35,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:35,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:26:35,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:26:35,939 INFO L87 Difference]: Start difference. First operand 143 states and 162 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) [2024-11-07 16:26:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:36,274 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2024-11-07 16:26:36,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:26:36,274 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 [2024-11-07 16:26:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:36,275 INFO L225 Difference]: With dead ends: 148 [2024-11-07 16:26:36,275 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 16:26:36,276 INFO L431 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 [2024-11-07 16:26:36,276 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 24 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:36,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 428 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:26:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 16:26:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2024-11-07 16:26:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.5977011494252873) internal successors, (139), 126 states have internal predecessors, (139), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:26:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 159 transitions. [2024-11-07 16:26:36,281 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 159 transitions. Word has length 11 [2024-11-07 16:26:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:36,281 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 159 transitions. [2024-11-07 16:26:36,281 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) [2024-11-07 16:26:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 159 transitions. [2024-11-07 16:26:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:26:36,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:36,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:36,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 16:26:36,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:36,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:36,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash -119151995, now seen corresponding path program 1 times [2024-11-07 16:26:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839043000] [2024-11-07 16:26:36,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:36,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:36,487 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:36,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 16:26:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:36,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 16:26:36,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:36,577 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 [2024-11-07 16:26:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:36,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:36,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:36,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839043000] [2024-11-07 16:26:36,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839043000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:36,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:36,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:26:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301160654] [2024-11-07 16:26:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:36,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:26:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:26:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:26:36,666 INFO L87 Difference]: Start difference. First operand 142 states and 159 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) [2024-11-07 16:26:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:37,032 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2024-11-07 16:26:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:26:37,033 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 [2024-11-07 16:26:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:37,034 INFO L225 Difference]: With dead ends: 146 [2024-11-07 16:26:37,035 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 16:26:37,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:26:37,036 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 19 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:37,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 457 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:26:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 16:26:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-11-07 16:26:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 126 states have internal predecessors, (137), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:26:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2024-11-07 16:26:37,042 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 11 [2024-11-07 16:26:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:37,042 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2024-11-07 16:26:37,043 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) [2024-11-07 16:26:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2024-11-07 16:26:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:26:37,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:37,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:37,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 16:26:37,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:37,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:37,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1459048871, now seen corresponding path program 1 times [2024-11-07 16:26:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:37,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725163619] [2024-11-07 16:26:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:37,248 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:37,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 16:26:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:37,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:26:37,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:37,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:37,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:37,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725163619] [2024-11-07 16:26:37,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725163619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:37,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:37,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:26:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031222626] [2024-11-07 16:26:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:37,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:26:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:37,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:26:37,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:26:37,369 INFO L87 Difference]: Start difference. First operand 142 states and 157 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) [2024-11-07 16:26:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:37,540 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2024-11-07 16:26:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:26:37,541 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 [2024-11-07 16:26:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:37,542 INFO L225 Difference]: With dead ends: 141 [2024-11-07 16:26:37,542 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 16:26:37,542 INFO L431 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 [2024-11-07 16:26:37,542 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:37,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 284 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:26:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 16:26:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-07 16:26:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 87 states have (on average 1.5517241379310345) internal successors, (135), 125 states have internal predecessors, (135), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:26:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2024-11-07 16:26:37,547 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 13 [2024-11-07 16:26:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:37,547 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2024-11-07 16:26:37,547 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) [2024-11-07 16:26:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2024-11-07 16:26:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:26:37,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:37,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:37,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-07 16:26:37,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:37,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:37,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1459048872, now seen corresponding path program 1 times [2024-11-07 16:26:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212064572] [2024-11-07 16:26:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:37,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:37,759 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:37,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 16:26:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:37,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:26:37,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:37,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:37,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212064572] [2024-11-07 16:26:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212064572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:37,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:37,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:26:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364205529] [2024-11-07 16:26:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:37,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:26:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:37,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:26:37,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:26:37,921 INFO L87 Difference]: Start difference. First operand 141 states and 155 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) [2024-11-07 16:26:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:38,238 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2024-11-07 16:26:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:26:38,238 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 [2024-11-07 16:26:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:38,239 INFO L225 Difference]: With dead ends: 143 [2024-11-07 16:26:38,239 INFO L226 Difference]: Without dead ends: 143 [2024-11-07 16:26:38,240 INFO L431 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 [2024-11-07 16:26:38,240 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 150 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:38,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 484 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:26:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-07 16:26:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-07 16:26:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 125 states have internal predecessors, (134), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:26:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2024-11-07 16:26:38,245 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 13 [2024-11-07 16:26:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:38,245 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2024-11-07 16:26:38,245 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) [2024-11-07 16:26:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2024-11-07 16:26:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:26:38,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:38,246 INFO L215 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] [2024-11-07 16:26:38,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-07 16:26:38,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:38,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:38,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1725134306, now seen corresponding path program 1 times [2024-11-07 16:26:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575881341] [2024-11-07 16:26:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:38,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:38,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:38,449 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:38,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 16:26:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:38,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:26:38,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:38,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:38,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:38,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575881341] [2024-11-07 16:26:38,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575881341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:38,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:38,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:26:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255620357] [2024-11-07 16:26:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:38,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:26:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:26:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:26:38,602 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-07 16:26:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:39,040 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2024-11-07 16:26:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:26:39,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2024-11-07 16:26:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:39,042 INFO L225 Difference]: With dead ends: 140 [2024-11-07 16:26:39,042 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 16:26:39,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:26:39,043 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 133 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:39,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 304 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:26:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 16:26:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-07 16:26:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 87 states have (on average 1.528735632183908) internal successors, (133), 124 states have internal predecessors, (133), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:26:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2024-11-07 16:26:39,048 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 23 [2024-11-07 16:26:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:39,048 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2024-11-07 16:26:39,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-07 16:26:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2024-11-07 16:26:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:26:39,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:39,049 INFO L215 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] [2024-11-07 16:26:39,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-07 16:26:39,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:39,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting list_emptyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:39,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1725134307, now seen corresponding path program 1 times [2024-11-07 16:26:39,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:39,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217531071] [2024-11-07 16:26:39,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:39,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:39,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:39,257 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:39,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 16:26:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:39,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 16:26:39,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:39,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:26:39,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217531071] [2024-11-07 16:26:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217531071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:26:39,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:26:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:26:39,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124245823] [2024-11-07 16:26:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:26:39,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:26:39,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:39,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:26:39,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:26:39,527 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-07 16:26:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:39,982 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2024-11-07 16:26:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:26:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2024-11-07 16:26:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:39,983 INFO L225 Difference]: With dead ends: 139 [2024-11-07 16:26:39,983 INFO L226 Difference]: Without dead ends: 139 [2024-11-07 16:26:39,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:26:39,984 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 228 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:39,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 309 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:26:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-07 16:26:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-07 16:26:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 87 states have (on average 1.5172413793103448) internal successors, (132), 123 states have internal predecessors, (132), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:26:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2024-11-07 16:26:39,989 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 23 [2024-11-07 16:26:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:39,989 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2024-11-07 16:26:39,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-07 16:26:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2024-11-07 16:26:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:26:39,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:39,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:39,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-07 16:26:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:40,190 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 271709624, now seen corresponding path program 1 times [2024-11-07 16:26:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933570686] [2024-11-07 16:26:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:40,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:40,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:40,194 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:40,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 16:26:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:40,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 16:26:40,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:40,391 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 [2024-11-07 16:26:40,572 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 [2024-11-07 16:26:40,724 INFO L349 Elim1Store]: treesize reduction 116, result has 26.6 percent of original size [2024-11-07 16:26:40,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 67 [2024-11-07 16:26:40,821 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 28 treesize of output 21 [2024-11-07 16:26:41,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 15 [2024-11-07 16:26:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:41,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:26:45,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:26:45,701 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 25 treesize of output 26 [2024-11-07 16:26:45,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:26:45,710 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 23 treesize of output 15 [2024-11-07 16:26:47,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933570686] [2024-11-07 16:26:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933570686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:26:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [44551691] [2024-11-07 16:26:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:47,433 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:26:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:26:47,503 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 16:26:47,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-07 16:26:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:47,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 16:26:47,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:47,870 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 16:26:47,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-07 16:26:48,280 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 [2024-11-07 16:26:48,512 INFO L349 Elim1Store]: treesize reduction 112, result has 27.3 percent of original size [2024-11-07 16:26:48,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 60 [2024-11-07 16:26:48,634 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 28 treesize of output 21 [2024-11-07 16:26:48,774 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 19 treesize of output 11 [2024-11-07 16:26:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:48,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:26:49,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:26:49,121 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 25 treesize of output 26 [2024-11-07 16:26:49,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:26:49,124 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 23 treesize of output 15 [2024-11-07 16:26:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [44551691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:26:53,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:26:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2024-11-07 16:26:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908377599] [2024-11-07 16:26:53,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:26:53,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:26:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:26:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:26:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1135, Unknown=39, NotChecked=0, Total=1332 [2024-11-07 16:26:53,175 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 27 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 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) [2024-11-07 16:26:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:26:56,075 INFO L93 Difference]: Finished difference Result 213 states and 231 transitions. [2024-11-07 16:26:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 16:26:56,075 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 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 27 [2024-11-07 16:26:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:26:56,076 INFO L225 Difference]: With dead ends: 213 [2024-11-07 16:26:56,076 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 16:26:56,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=369, Invalid=2042, Unknown=39, NotChecked=0, Total=2450 [2024-11-07 16:26:56,077 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 332 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:26:56,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 920 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 16:26:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 16:26:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2024-11-07 16:26:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 129 states have internal predecessors, (136), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 16:26:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2024-11-07 16:26:56,083 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 27 [2024-11-07 16:26:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:26:56,083 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2024-11-07 16:26:56,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 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) [2024-11-07 16:26:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2024-11-07 16:26:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 16:26:56,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:26:56,084 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:26:56,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-07 16:26:56,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-07 16:26:56,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 16:26:56,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:26:56,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:26:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash 271709625, now seen corresponding path program 1 times [2024-11-07 16:26:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:26:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689813276] [2024-11-07 16:26:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:56,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:26:56,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:26:56,488 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:26:56,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-07 16:26:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:56,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 16:26:56,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:56,675 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 [2024-11-07 16:26:56,682 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 [2024-11-07 16:26:56,935 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 [2024-11-07 16:26:56,940 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 [2024-11-07 16:26:57,139 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2024-11-07 16:26:57,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 35 [2024-11-07 16:26:57,150 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 16:26:57,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 [2024-11-07 16:26:57,225 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 26 treesize of output 19 [2024-11-07 16:26:57,231 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 [2024-11-07 16:26:57,335 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 17 treesize of output 9 [2024-11-07 16:26:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:57,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:26:57,669 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_478) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_479) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2024-11-07 16:26:58,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:26:58,163 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 41 treesize of output 32 [2024-11-07 16:26:58,165 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:26:58,167 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 26 treesize of output 14 [2024-11-07 16:26:58,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:26:58,181 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 42 treesize of output 43 [2024-11-07 16:26:58,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:26:58,187 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 40 treesize of output 32 [2024-11-07 16:26:58,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:26:58,198 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 27 treesize of output 28 [2024-11-07 16:26:58,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:26:58,204 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 17 [2024-11-07 16:26:58,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:26:58,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689813276] [2024-11-07 16:26:58,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689813276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:26:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1659889824] [2024-11-07 16:26:58,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:26:58,316 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:26:58,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:26:58,318 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 16:26:58,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-07 16:26:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:26:58,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-07 16:26:58,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:26:58,680 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 [2024-11-07 16:26:58,684 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 [2024-11-07 16:26:59,264 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 [2024-11-07 16:26:59,269 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 [2024-11-07 16:26:59,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:26:59,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:26:59,555 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 16:26:59,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2024-11-07 16:26:59,581 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2024-11-07 16:26:59,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 35 [2024-11-07 16:26:59,707 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 [2024-11-07 16:26:59,711 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 26 treesize of output 19 [2024-11-07 16:26:59,939 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 17 treesize of output 9 [2024-11-07 16:26:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:26:59,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:27:00,018 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_552) |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~0#1.base| v_ArrVal_551) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_552) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2024-11-07 16:27:00,082 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_23| (_ BitVec 32))) (or (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_550 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23| v_ArrVal_552) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23| v_ArrVal_550) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23| v_ArrVal_551) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23|))))) (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_23| (_ BitVec 32))) (or (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23| v_ArrVal_552) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_23|)))))) is different from false [2024-11-07 16:27:00,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:27:00,302 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 41 treesize of output 32 [2024-11-07 16:27:00,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:27:00,305 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 26 treesize of output 14 [2024-11-07 16:27:00,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:27:00,316 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 42 treesize of output 43 [2024-11-07 16:27:00,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:27:00,319 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 40 treesize of output 32 [2024-11-07 16:27:00,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:27:00,326 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 27 treesize of output 28 [2024-11-07 16:27:00,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:27:00,329 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 17 [2024-11-07 16:27:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1659889824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:27:00,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:27:00,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 16:27:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931992582] [2024-11-07 16:27:00,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:27:00,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:27:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:27:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:27:00,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1057, Unknown=6, NotChecked=204, Total=1406 [2024-11-07 16:27:00,453 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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) [2024-11-07 16:27:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:27:03,835 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2024-11-07 16:27:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:27:03,836 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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 27 [2024-11-07 16:27:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:27:03,837 INFO L225 Difference]: With dead ends: 211 [2024-11-07 16:27:03,837 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 16:27:03,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=313, Invalid=1673, Unknown=6, NotChecked=264, Total=2256 [2024-11-07 16:27:03,838 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 484 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:27:03,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 727 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 16:27:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 16:27:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 138. [2024-11-07 16:27:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 122 states have internal predecessors, (128), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:27:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2024-11-07 16:27:03,848 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 27 [2024-11-07 16:27:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:27:03,848 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2024-11-07 16:27:03,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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) [2024-11-07 16:27:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2024-11-07 16:27:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:27:03,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:27:03,849 INFO L215 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, 1, 1] [2024-11-07 16:27:03,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-07 16:27:04,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-07 16:27:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:04,251 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:27:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:27:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1042645598, now seen corresponding path program 1 times [2024-11-07 16:27:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:27:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115664643] [2024-11-07 16:27:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:27:04,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:04,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:27:04,254 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:27:04,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-07 16:27:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:27:04,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 16:27:04,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:27:04,498 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 [2024-11-07 16:27:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:27:04,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:27:04,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:27:04,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115664643] [2024-11-07 16:27:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115664643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:27:04,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:27:04,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:27:04,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406411169] [2024-11-07 16:27:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:27:04,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:27:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:27:04,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:27:04,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:27:04,677 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:27:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:27:05,248 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2024-11-07 16:27:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:27:05,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-07 16:27:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:27:05,250 INFO L225 Difference]: With dead ends: 186 [2024-11-07 16:27:05,250 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 16:27:05,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:27:05,251 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 210 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:27:05,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 731 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:27:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 16:27:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2024-11-07 16:27:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.5060240963855422) internal successors, (125), 120 states have internal predecessors, (125), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:27:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2024-11-07 16:27:05,256 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 32 [2024-11-07 16:27:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:27:05,256 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2024-11-07 16:27:05,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:27:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2024-11-07 16:27:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 16:27:05,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:27:05,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2024-11-07 16:27:05,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-07 16:27:05,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:05,458 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:27:05,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:27:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1694395089, now seen corresponding path program 1 times [2024-11-07 16:27:05,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:27:05,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185952240] [2024-11-07 16:27:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:27:05,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:05,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:27:05,461 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:27:05,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-07 16:27:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:27:05,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 16:27:05,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:27:05,692 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 [2024-11-07 16:27:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:27:05,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:27:05,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:27:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185952240] [2024-11-07 16:27:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185952240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:27:05,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:27:05,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:27:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286183013] [2024-11-07 16:27:05,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:27:05,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:27:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:27:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:27:05,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:27:05,965 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:27:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:27:06,570 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2024-11-07 16:27:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:27:06,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-07 16:27:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:27:06,572 INFO L225 Difference]: With dead ends: 186 [2024-11-07 16:27:06,572 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 16:27:06,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:27:06,573 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 203 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:27:06,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 719 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 16:27:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 16:27:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 137. [2024-11-07 16:27:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.5) internal successors, (126), 120 states have internal predecessors, (126), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:27:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2024-11-07 16:27:06,577 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 38 [2024-11-07 16:27:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:27:06,577 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2024-11-07 16:27:06,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:27:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2024-11-07 16:27:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 16:27:06,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:27:06,578 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:27:06,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-07 16:27:06,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:06,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:27:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:27:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 544978300, now seen corresponding path program 1 times [2024-11-07 16:27:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:27:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071898889] [2024-11-07 16:27:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:27:06,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:06,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:27:06,782 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:27:06,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-07 16:27:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:27:06,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 16:27:06,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:27:06,949 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 [2024-11-07 16:27:07,040 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 [2024-11-07 16:27:07,153 INFO L349 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2024-11-07 16:27:07,154 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 3 case distinctions, treesize of input 25 treesize of output 36 [2024-11-07 16:27:07,238 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 19 treesize of output 11 [2024-11-07 16:27:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 16:27:07,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:27:07,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:27:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071898889] [2024-11-07 16:27:07,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071898889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:27:07,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:27:07,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:27:07,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820406716] [2024-11-07 16:27:07,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:27:07,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:27:07,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:27:07,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:27:07,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:27:07,320 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:27:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:27:08,548 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2024-11-07 16:27:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:27:08,548 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-07 16:27:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:27:08,549 INFO L225 Difference]: With dead ends: 206 [2024-11-07 16:27:08,549 INFO L226 Difference]: Without dead ends: 206 [2024-11-07 16:27:08,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-07 16:27:08,550 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 202 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:27:08,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 517 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 16:27:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-07 16:27:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 159. [2024-11-07 16:27:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 138 states have internal predecessors, (152), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:27:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions. [2024-11-07 16:27:08,557 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 40 [2024-11-07 16:27:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:27:08,558 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 176 transitions. [2024-11-07 16:27:08,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 16:27:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions. [2024-11-07 16:27:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 16:27:08,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:27:08,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:27:08,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-07 16:27:08,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:08,760 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:27:08,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:27:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 544978301, now seen corresponding path program 1 times [2024-11-07 16:27:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:27:08,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840391632] [2024-11-07 16:27:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:27:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:27:08,763 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:27:08,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-07 16:27:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:27:08,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 16:27:08,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:27:08,943 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 [2024-11-07 16:27:08,948 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 [2024-11-07 16:27:09,171 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 [2024-11-07 16:27:09,175 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 [2024-11-07 16:27:09,487 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2024-11-07 16:27:09,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-07 16:27:09,498 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 16:27:09,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2024-11-07 16:27:09,611 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 17 treesize of output 9 [2024-11-07 16:27:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:27:09,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:27:10,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:27:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840391632] [2024-11-07 16:27:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840391632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:27:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [304075510] [2024-11-07 16:27:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:27:10,468 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:27:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:27:10,470 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 16:27:10,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-07 16:27:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:27:10,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 16:27:10,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:27:10,820 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 [2024-11-07 16:27:11,207 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 [2024-11-07 16:27:11,223 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 [2024-11-07 16:27:11,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:27:11,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:27:11,671 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 16:27:11,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2024-11-07 16:27:12,007 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-07 16:27:12,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2024-11-07 16:27:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:27:12,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:27:12,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [304075510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:27:12,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:27:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2024-11-07 16:27:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341393761] [2024-11-07 16:27:12,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:27:12,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 16:27:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:27:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 16:27:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2024-11-07 16:27:12,831 INFO L87 Difference]: Start difference. First operand 159 states and 176 transitions. Second operand has 25 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:27:24,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:27:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:27:25,399 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2024-11-07 16:27:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 16:27:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-07 16:27:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:27:25,400 INFO L225 Difference]: With dead ends: 203 [2024-11-07 16:27:25,401 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 16:27:25,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 16:27:25,401 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 504 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:27:25,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 767 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-07 16:27:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 16:27:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 164. [2024-11-07 16:27:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.4528301886792452) internal successors, (154), 142 states have internal predecessors, (154), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 16:27:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2024-11-07 16:27:25,407 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 40 [2024-11-07 16:27:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:27:25,407 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2024-11-07 16:27:25,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.0) internal successors, (66), 21 states have internal predecessors, (66), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:27:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2024-11-07 16:27:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 16:27:25,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:27:25,408 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:27:25,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-07 16:27:25,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-07 16:27:25,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 16:27:25,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-11-07 16:27:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:27:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash -67834378, now seen corresponding path program 1 times [2024-11-07 16:27:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:27:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546695944] [2024-11-07 16:27:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:27:25,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:27:25,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:27:25,814 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:27:25,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-07 16:27:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:27:26,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-07 16:27:26,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:27:26,080 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:27:26,080 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 [2024-11-07 16:27:26,100 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 [2024-11-07 16:27:26,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-07 16:27:26,224 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 15 treesize of output 11 [2024-11-07 16:27:26,266 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-07 16:27:26,384 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-11-07 16:27:26,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 56 [2024-11-07 16:27:26,388 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 23 treesize of output 13 [2024-11-07 16:27:26,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-07 16:27:26,910 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 40 treesize of output 28 [2024-11-07 16:27:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:27:27,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:27:27,648 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-11-07 16:27:27,648 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 28 treesize of output 27 [2024-11-07 16:27:27,777 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-11-07 16:27:27,777 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 28 treesize of output 27 [2024-11-07 16:27:28,491 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 76 treesize of output 72 [2024-11-07 16:27:38,293 WARN L286 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 205 DAG size of output: 102 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-07 16:27:38,293 INFO L349 Elim1Store]: treesize reduction 431, result has 31.9 percent of original size [2024-11-07 16:27:38,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 38 case distinctions, treesize of input 26755 treesize of output 23880 [2024-11-07 16:27:39,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:27:39,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1213 treesize of output 1273 [2024-11-07 16:27:50,235 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 6 treesize of output 4