./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/uthash-2.0.2/uthash_SAX_test7-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f'] 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/uthash-2.0.2/uthash_SAX_test7-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:10:01,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:10:01,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-07 16:10:01,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:10:01,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:10:01,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:10:01,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:10:01,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:10:01,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:10:01,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:10:01,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:10:01,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:10:01,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:10:01,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:10:01,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:10:01,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:10:01,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:10:01,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:10:01,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:10:01,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:10:01,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:10:01,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:10:01,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:10:01,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:10:01,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:10:01,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:10:01,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:10:01,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:10:01,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:10:01,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:10:01,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:10:01,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:10:01,553 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-memcleanup) ) 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 -> 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f [2024-11-07 16:10:01,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:10:01,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:10:01,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:10:01,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:10:01,864 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:10:01,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2024-11-07 16:10:03,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:10:03,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:10:03,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2024-11-07 16:10:03,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee125e7f/da33fe1ff2e94b98a4c3c05e4aba698c/FLAGa913e481b [2024-11-07 16:10:03,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aee125e7f/da33fe1ff2e94b98a4c3c05e4aba698c [2024-11-07 16:10:03,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:10:03,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:10:03,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:10:03,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:10:03,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:10:03,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:10:03" (1/1) ... [2024-11-07 16:10:03,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cf8b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:03, skipping insertion in model container [2024-11-07 16:10:03,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:10:03" (1/1) ... [2024-11-07 16:10:03,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:10:04,123 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,152 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,156 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,160 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,167 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,200 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,200 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,202 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,202 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,207 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,209 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,210 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,210 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,214 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,215 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,217 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,217 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,218 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,219 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,222 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:04,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:10:04,244 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:10:04,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@15bbaf38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:04, skipping insertion in model container [2024-11-07 16:10:04,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:10:04,245 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 16:10:04,249 INFO L158 Benchmark]: Toolchain (without parser) took 493.61ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 69.7MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:10:04,251 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:10:04,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.74ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 69.7MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:10:04,253 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.24ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.74ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 69.7MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: 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/uthash-2.0.2/uthash_SAX_test7-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:10:06,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:10:06,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-07 16:10:06,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:10:06,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:10:06,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:10:06,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:10:06,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:10:06,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:10:06,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:10:06,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:10:06,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:10:06,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:10:06,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:10:06,517 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:10:06,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:10:06,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:10:06,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:10:06,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:10:06,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:10:06,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:10:06,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:10:06,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:10:06,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:10:06,520 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:10:06,520 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:10:06,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:10:06,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:10:06,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:10:06,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:10:06,520 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-memcleanup) ) 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 -> 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f [2024-11-07 16:10:06,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:10:06,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:10:06,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:10:06,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:10:06,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:10:06,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2024-11-07 16:10:08,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:10:08,621 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:10:08,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2024-11-07 16:10:08,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477655601/bcd4898c4fef4063865d0b929cde1ee1/FLAG4613fcfde [2024-11-07 16:10:08,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477655601/bcd4898c4fef4063865d0b929cde1ee1 [2024-11-07 16:10:08,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:10:08,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:10:08,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:10:08,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:10:08,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:10:08,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:10:08" (1/1) ... [2024-11-07 16:10:08,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1429602c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:08, skipping insertion in model container [2024-11-07 16:10:08,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:10:08" (1/1) ... [2024-11-07 16:10:08,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:10:09,210 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,239 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,243 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,248 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,256 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,300 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,300 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,302 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,303 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,306 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,308 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,309 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,310 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,315 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,316 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,318 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,319 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,320 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,321 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,324 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:10:09,349 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 16:10:09,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:10:09,392 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,413 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,415 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,417 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,453 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,453 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,454 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,455 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,459 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,459 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,460 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,460 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,465 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,466 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,468 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,468 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,470 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,471 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:10:09,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:10:09,487 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:10:09,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:10:09,631 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:10:09,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09 WrapperNode [2024-11-07 16:10:09,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:10:09,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:10:09,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:10:09,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:10:09,641 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:10:09" (1/1) ... [2024-11-07 16:10:09,665 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:10:09" (1/1) ... [2024-11-07 16:10:09,723 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-11-07 16:10:09,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:10:09,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:10:09,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:10:09,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:10:09,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,855 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-07 16:10:09,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:10:09,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:10:09,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:10:09,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:10:09,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (1/1) ... [2024-11-07 16:10:09,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:10:09,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:10:09,995 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:10:10,000 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:10:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 16:10:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 16:10:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 16:10:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 16:10:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 16:10:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 16:10:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 16:10:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 16:10:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 16:10:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 16:10:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 16:10:10,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 16:10:10,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 16:10:10,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 16:10:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:10:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:10:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 16:10:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 16:10:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 16:10:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 16:10:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 16:10:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:10:10,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:10:10,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:10:10,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:10:18,147 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-07 16:10:18,147 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:10:18,162 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:10:18,164 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-07 16:10:18,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:10:18 BoogieIcfgContainer [2024-11-07 16:10:18,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:10:18,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:10:18,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:10:18,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:10:18,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:10:08" (1/3) ... [2024-11-07 16:10:18,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a737cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:10:18, skipping insertion in model container [2024-11-07 16:10:18,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:10:09" (2/3) ... [2024-11-07 16:10:18,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a737cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:10:18, skipping insertion in model container [2024-11-07 16:10:18,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:10:18" (3/3) ... [2024-11-07 16:10:18,175 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test7-2.i [2024-11-07 16:10:18,195 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:10:18,196 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 16:10:18,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:10:18,250 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;@77de41f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:10:18,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 16:10:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 218 states have (on average 1.665137614678899) internal successors, (363), 221 states have internal predecessors, (363), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 16:10:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:10:18,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:18,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:10:18,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:18,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash -718902403, now seen corresponding path program 1 times [2024-11-07 16:10:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:18,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242850536] [2024-11-07 16:10:18,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:18,280 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:10:18,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:18,282 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:10:18,283 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:10:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:18,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 16:10:18,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:18,496 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:10:18,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:18,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242850536] [2024-11-07 16:10:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242850536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:10:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988934] [2024-11-07 16:10:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:18,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:10:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:18,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:10:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:10:18,530 INFO L87 Difference]: Start difference. First operand has 228 states, 218 states have (on average 1.665137614678899) internal successors, (363), 221 states have internal predecessors, (363), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:10:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:18,562 INFO L93 Difference]: Finished difference Result 225 states and 291 transitions. [2024-11-07 16:10:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:10:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:10:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:18,571 INFO L225 Difference]: With dead ends: 225 [2024-11-07 16:10:18,572 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 16:10:18,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:10:18,577 INFO L432 NwaCegarLoop]: 291 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, 291 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:10:18,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:10:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 16:10:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-11-07 16:10:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 215 states have (on average 1.3069767441860465) internal successors, (281), 217 states have internal predecessors, (281), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:10:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 289 transitions. [2024-11-07 16:10:18,630 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 289 transitions. Word has length 10 [2024-11-07 16:10:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:18,631 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 289 transitions. [2024-11-07 16:10:18,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:10:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 289 transitions. [2024-11-07 16:10:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:10:18,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:18,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:10:18,639 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:10:18,835 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:10:18,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:18,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1957560088, now seen corresponding path program 1 times [2024-11-07 16:10:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:18,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635674488] [2024-11-07 16:10:18,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:18,836 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:10:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:18,839 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:10:18,840 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:10:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:18,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:10:19,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:19,104 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:10:19,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:19,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:19,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635674488] [2024-11-07 16:10:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635674488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:19,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:10:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371397625] [2024-11-07 16:10:19,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:19,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:10:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:19,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:10:19,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:10:19,106 INFO L87 Difference]: Start difference. First operand 223 states and 289 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:10:23,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:10:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:25,068 INFO L93 Difference]: Finished difference Result 370 states and 480 transitions. [2024-11-07 16:10:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:10:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 12 [2024-11-07 16:10:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:25,073 INFO L225 Difference]: With dead ends: 370 [2024-11-07 16:10:25,073 INFO L226 Difference]: Without dead ends: 370 [2024-11-07 16:10:25,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:10:25,074 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 182 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:25,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 809 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-11-07 16:10:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-07 16:10:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 337. [2024-11-07 16:10:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 329 states have (on average 1.3069908814589666) internal successors, (430), 331 states have internal predecessors, (430), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:10:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 438 transitions. [2024-11-07 16:10:25,102 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 438 transitions. Word has length 12 [2024-11-07 16:10:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:25,103 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 438 transitions. [2024-11-07 16:10:25,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:10:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 438 transitions. [2024-11-07 16:10:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:10:25,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:25,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:10:25,108 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:10:25,307 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:10:25,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:25,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash -168573432, now seen corresponding path program 1 times [2024-11-07 16:10:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:25,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838995337] [2024-11-07 16:10:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:25,308 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:10:25,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:25,310 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:10:25,311 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:10:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:25,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:10:25,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:25,524 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:10:25,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:10:25,534 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 33 treesize of output 31 [2024-11-07 16:10:25,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:10:25,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 62 treesize of output 22 [2024-11-07 16:10:25,641 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:10:25,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:25,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:25,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838995337] [2024-11-07 16:10:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838995337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:25,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:25,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:10:25,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441652388] [2024-11-07 16:10:25,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:25,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:10:25,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:25,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:10:25,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:10:25,642 INFO L87 Difference]: Start difference. First operand 337 states and 438 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:10:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:26,296 INFO L93 Difference]: Finished difference Result 531 states and 694 transitions. [2024-11-07 16:10:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:10:26,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-07 16:10:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:26,301 INFO L225 Difference]: With dead ends: 531 [2024-11-07 16:10:26,301 INFO L226 Difference]: Without dead ends: 531 [2024-11-07 16:10:26,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:10:26,302 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 264 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:26,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 799 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:10:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-07 16:10:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 336. [2024-11-07 16:10:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 328 states have (on average 1.3048780487804879) internal successors, (428), 330 states have internal predecessors, (428), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:10:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 436 transitions. [2024-11-07 16:10:26,340 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 436 transitions. Word has length 15 [2024-11-07 16:10:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:26,340 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 436 transitions. [2024-11-07 16:10:26,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:10:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 436 transitions. [2024-11-07 16:10:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 16:10:26,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:26,342 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, 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, 1, 1, 1] [2024-11-07 16:10:26,348 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:10:26,546 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:10:26,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:26,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash 223342889, now seen corresponding path program 1 times [2024-11-07 16:10:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673392563] [2024-11-07 16:10:26,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:26,548 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:10:26,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:26,551 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:10:26,559 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:10:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:27,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:10:27,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:10:27,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:27,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673392563] [2024-11-07 16:10:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673392563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:27,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:10:27,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78959711] [2024-11-07 16:10:27,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:27,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:10:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:27,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:10:27,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:10:27,094 INFO L87 Difference]: Start difference. First operand 336 states and 436 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:10:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:27,247 INFO L93 Difference]: Finished difference Result 342 states and 426 transitions. [2024-11-07 16:10:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:10:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-11-07 16:10:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:27,250 INFO L225 Difference]: With dead ends: 342 [2024-11-07 16:10:27,250 INFO L226 Difference]: Without dead ends: 342 [2024-11-07 16:10:27,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:10:27,251 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 30 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:27,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 758 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:10:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-07 16:10:27,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-07 16:10:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 334 states have (on average 1.251497005988024) internal successors, (418), 336 states have internal predecessors, (418), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:10:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 426 transitions. [2024-11-07 16:10:27,265 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 426 transitions. Word has length 83 [2024-11-07 16:10:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:27,266 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 426 transitions. [2024-11-07 16:10:27,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:10:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 426 transitions. [2024-11-07 16:10:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 16:10:27,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:27,270 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, 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, 1, 1, 1] [2024-11-07 16:10:27,280 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:10:27,473 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:10:27,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:27,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1716862051, now seen corresponding path program 1 times [2024-11-07 16:10:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:27,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649756443] [2024-11-07 16:10:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:27,475 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:10:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:27,478 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:10:27,480 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:10:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:27,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:10:27,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:10:27,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:27,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:27,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649756443] [2024-11-07 16:10:27,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649756443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:27,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:27,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:10:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817813511] [2024-11-07 16:10:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:27,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:10:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:27,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:10:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:10:27,970 INFO L87 Difference]: Start difference. First operand 342 states and 426 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:10:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:28,014 INFO L93 Difference]: Finished difference Result 345 states and 430 transitions. [2024-11-07 16:10:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:10:28,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2024-11-07 16:10:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:28,017 INFO L225 Difference]: With dead ends: 345 [2024-11-07 16:10:28,018 INFO L226 Difference]: Without dead ends: 345 [2024-11-07 16:10:28,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 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:10:28,018 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:28,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 821 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:10:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-07 16:10:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-11-07 16:10:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 336 states have (on average 1.2529761904761905) internal successors, (421), 339 states have internal predecessors, (421), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 430 transitions. [2024-11-07 16:10:28,028 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 430 transitions. Word has length 83 [2024-11-07 16:10:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:28,028 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 430 transitions. [2024-11-07 16:10:28,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:10:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 430 transitions. [2024-11-07 16:10:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 16:10:28,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:28,030 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, 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:10:28,042 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:10:28,231 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:10:28,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 701158495, now seen corresponding path program 1 times [2024-11-07 16:10:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213775336] [2024-11-07 16:10:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:28,233 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:10:28,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:28,235 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:10:28,235 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:10:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:28,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:10:28,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:10:28,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:10:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:10:28,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:28,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213775336] [2024-11-07 16:10:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213775336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:10:28,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:10:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:10:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022510100] [2024-11-07 16:10:28,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:10:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:10:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:10:28,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:10:28,901 INFO L87 Difference]: Start difference. First operand 345 states and 430 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:10:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:29,081 INFO L93 Difference]: Finished difference Result 356 states and 446 transitions. [2024-11-07 16:10:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:10:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 85 [2024-11-07 16:10:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:29,084 INFO L225 Difference]: With dead ends: 356 [2024-11-07 16:10:29,084 INFO L226 Difference]: Without dead ends: 356 [2024-11-07 16:10:29,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:10:29,085 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 5 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:29,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1364 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:10:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-07 16:10:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2024-11-07 16:10:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 344 states have (on average 1.2645348837209303) internal successors, (435), 347 states have internal predecessors, (435), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 444 transitions. [2024-11-07 16:10:29,095 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 444 transitions. Word has length 85 [2024-11-07 16:10:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:29,095 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 444 transitions. [2024-11-07 16:10:29,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:10:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 444 transitions. [2024-11-07 16:10:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 16:10:29,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:29,097 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 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:10:29,108 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:10:29,297 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:10:29,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:29,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1147835837, now seen corresponding path program 2 times [2024-11-07 16:10:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:29,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822346964] [2024-11-07 16:10:29,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:10:29,299 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:10:29,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:29,301 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:10:29,303 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:10:29,622 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:10:29,622 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:10:29,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:10:29,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:29,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:10:29,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:10:29,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:10:29,647 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 30 treesize of output 39 [2024-11-07 16:10:29,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:10:29,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 26 [2024-11-07 16:10:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-07 16:10:29,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:29,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822346964] [2024-11-07 16:10:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822346964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:29,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:29,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:10:29,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572926423] [2024-11-07 16:10:29,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:29,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:10:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:29,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:10:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:10:29,730 INFO L87 Difference]: Start difference. First operand 354 states and 444 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:10:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:30,214 INFO L93 Difference]: Finished difference Result 514 states and 655 transitions. [2024-11-07 16:10:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:10:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-07 16:10:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:30,218 INFO L225 Difference]: With dead ends: 514 [2024-11-07 16:10:30,218 INFO L226 Difference]: Without dead ends: 514 [2024-11-07 16:10:30,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:10:30,218 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 207 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:30,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 769 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:10:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-07 16:10:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 356. [2024-11-07 16:10:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 346 states have (on average 1.2630057803468209) internal successors, (437), 349 states have internal predecessors, (437), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 446 transitions. [2024-11-07 16:10:30,228 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 446 transitions. Word has length 89 [2024-11-07 16:10:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:30,229 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 446 transitions. [2024-11-07 16:10:30,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:10:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 446 transitions. [2024-11-07 16:10:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 16:10:30,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:30,230 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 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, 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:10:30,235 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:10:30,430 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:10:30,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash -28955861, now seen corresponding path program 1 times [2024-11-07 16:10:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824175180] [2024-11-07 16:10:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:30,432 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:10:30,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:30,434 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:10:30,434 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:10:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:30,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:10:30,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:10:31,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:10:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:10:31,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:31,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824175180] [2024-11-07 16:10:31,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824175180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:10:31,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:10:31,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 16:10:31,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85571386] [2024-11-07 16:10:31,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:10:31,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:10:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:10:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:10:31,193 INFO L87 Difference]: Start difference. First operand 356 states and 446 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:10:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:31,830 INFO L93 Difference]: Finished difference Result 371 states and 468 transitions. [2024-11-07 16:10:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:10:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2024-11-07 16:10:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:31,833 INFO L225 Difference]: With dead ends: 371 [2024-11-07 16:10:31,833 INFO L226 Difference]: Without dead ends: 367 [2024-11-07 16:10:31,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:10:31,834 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 7 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:31,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2453 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:10:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-07 16:10:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2024-11-07 16:10:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 355 states have (on average 1.2647887323943663) internal successors, (449), 358 states have internal predecessors, (449), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 458 transitions. [2024-11-07 16:10:31,843 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 458 transitions. Word has length 125 [2024-11-07 16:10:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:31,843 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 458 transitions. [2024-11-07 16:10:31,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:10:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 458 transitions. [2024-11-07 16:10:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 16:10:31,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:31,845 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 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, 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:10:31,861 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:10:32,045 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:10:32,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:32,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash 396192818, now seen corresponding path program 2 times [2024-11-07 16:10:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:32,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408722117] [2024-11-07 16:10:32,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:10:32,049 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:10:32,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:32,051 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:10:32,054 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:10:32,354 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:10:32,354 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:10:32,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:10:32,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-07 16:10:32,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:32,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:32,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408722117] [2024-11-07 16:10:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408722117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:10:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899113272] [2024-11-07 16:10:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:32,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:10:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:10:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:10:32,393 INFO L87 Difference]: Start difference. First operand 365 states and 458 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:10:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:32,531 INFO L93 Difference]: Finished difference Result 371 states and 448 transitions. [2024-11-07 16:10:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:10:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 134 [2024-11-07 16:10:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:32,534 INFO L225 Difference]: With dead ends: 371 [2024-11-07 16:10:32,534 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 16:10:32,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:10:32,535 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 30 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:32,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 725 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:10:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 16:10:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2024-11-07 16:10:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 361 states have (on average 1.2160664819944598) internal successors, (439), 364 states have internal predecessors, (439), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 448 transitions. [2024-11-07 16:10:32,546 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 448 transitions. Word has length 134 [2024-11-07 16:10:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:32,546 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 448 transitions. [2024-11-07 16:10:32,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:10:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 448 transitions. [2024-11-07 16:10:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 16:10:32,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:32,548 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 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, 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:10:32,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 (10)] Ended with exit code 0 [2024-11-07 16:10:32,752 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:10:32,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:32,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:32,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1746122662, now seen corresponding path program 1 times [2024-11-07 16:10:32,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:32,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140177639] [2024-11-07 16:10:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:32,754 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:10:32,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:32,757 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:10:32,757 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:10:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:33,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 16:10:33,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 16:10:33,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:10:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 16:10:34,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:34,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140177639] [2024-11-07 16:10:34,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140177639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:10:34,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:10:34,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 16:10:34,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767452870] [2024-11-07 16:10:34,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:10:34,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 16:10:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:34,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 16:10:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:10:34,142 INFO L87 Difference]: Start difference. First operand 371 states and 448 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:10:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:35,756 INFO L93 Difference]: Finished difference Result 395 states and 488 transitions. [2024-11-07 16:10:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 16:10:35,757 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 134 [2024-11-07 16:10:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:35,759 INFO L225 Difference]: With dead ends: 395 [2024-11-07 16:10:35,759 INFO L226 Difference]: Without dead ends: 391 [2024-11-07 16:10:35,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 16:10:35,762 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 14 mSDsluCounter, 3662 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3926 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:35,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3926 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 16:10:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-07 16:10:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2024-11-07 16:10:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.2216358839050132) internal successors, (463), 382 states have internal predecessors, (463), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 472 transitions. [2024-11-07 16:10:35,772 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 472 transitions. Word has length 134 [2024-11-07 16:10:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:35,773 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 472 transitions. [2024-11-07 16:10:35,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:10:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 472 transitions. [2024-11-07 16:10:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 16:10:35,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:35,776 INFO L215 NwaCegarLoop]: trace histogram [33, 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, 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, 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:10:35,790 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:10:35,976 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:10:35,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:35,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -320053946, now seen corresponding path program 2 times [2024-11-07 16:10:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342740266] [2024-11-07 16:10:35,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:10:35,979 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:10:35,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:35,981 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:10:35,984 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:10:36,376 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:10:36,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:10:36,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:10:36,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-07 16:10:36,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:36,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342740266] [2024-11-07 16:10:36,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342740266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:36,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:36,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:10:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075004308] [2024-11-07 16:10:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:36,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:10:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:10:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:10:36,423 INFO L87 Difference]: Start difference. First operand 389 states and 472 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:10:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:36,499 INFO L93 Difference]: Finished difference Result 389 states and 466 transitions. [2024-11-07 16:10:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:10:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-11-07 16:10:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:36,502 INFO L225 Difference]: With dead ends: 389 [2024-11-07 16:10:36,502 INFO L226 Difference]: Without dead ends: 389 [2024-11-07 16:10:36,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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:10:36,503 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:36,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:10:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-07 16:10:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-07 16:10:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 379 states have (on average 1.2058047493403694) internal successors, (457), 382 states have internal predecessors, (457), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 466 transitions. [2024-11-07 16:10:36,511 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 466 transitions. Word has length 152 [2024-11-07 16:10:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:36,511 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 466 transitions. [2024-11-07 16:10:36,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:10:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 466 transitions. [2024-11-07 16:10:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 16:10:36,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:36,512 INFO L215 NwaCegarLoop]: trace histogram [33, 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, 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, 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:10:36,517 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 (12)] Ended with exit code 0 [2024-11-07 16:10:36,713 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:10:36,713 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:36,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash 701014408, now seen corresponding path program 1 times [2024-11-07 16:10:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:36,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728929414] [2024-11-07 16:10:36,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:10:36,714 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:10:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:36,716 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:10:36,717 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:10:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:10:37,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 16:10:37,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-07 16:10:38,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:10:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-07 16:10:39,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728929414] [2024-11-07 16:10:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728929414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:10:39,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:10:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-07 16:10:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186152689] [2024-11-07 16:10:39,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:10:39,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 16:10:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 16:10:39,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 16:10:39,907 INFO L87 Difference]: Start difference. First operand 389 states and 466 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:10:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:46,040 INFO L93 Difference]: Finished difference Result 429 states and 538 transitions. [2024-11-07 16:10:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-07 16:10:46,041 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 152 [2024-11-07 16:10:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:46,043 INFO L225 Difference]: With dead ends: 429 [2024-11-07 16:10:46,043 INFO L226 Difference]: Without dead ends: 425 [2024-11-07 16:10:46,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-07 16:10:46,046 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 26 mSDsluCounter, 6288 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6552 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:46,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6552 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1916 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 16:10:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-07 16:10:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2024-11-07 16:10:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 413 states have (on average 1.2179176755447942) internal successors, (503), 416 states have internal predecessors, (503), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 512 transitions. [2024-11-07 16:10:46,055 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 512 transitions. Word has length 152 [2024-11-07 16:10:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:46,056 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 512 transitions. [2024-11-07 16:10:46,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:10:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 512 transitions. [2024-11-07 16:10:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 16:10:46,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:46,058 INFO L215 NwaCegarLoop]: trace histogram [67, 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, 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, 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:10:46,076 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 (13)] Ended with exit code 0 [2024-11-07 16:10:46,258 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:10:46,259 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:46,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash -586779288, now seen corresponding path program 2 times [2024-11-07 16:10:46,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:46,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448487345] [2024-11-07 16:10:46,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:10:46,260 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:10:46,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:46,264 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:10:46,265 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:10:47,470 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:10:47,470 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:10:47,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:10:47,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-07 16:10:48,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:10:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-07 16:10:49,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448487345] [2024-11-07 16:10:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448487345] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:10:49,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:10:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-07 16:10:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092414796] [2024-11-07 16:10:49,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:10:49,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 16:10:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:49,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 16:10:49,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 16:10:49,928 INFO L87 Difference]: Start difference. First operand 423 states and 512 transitions. Second operand has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:10:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:10:58,346 INFO L93 Difference]: Finished difference Result 452 states and 566 transitions. [2024-11-07 16:10:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-07 16:10:58,348 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 186 [2024-11-07 16:10:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:10:58,350 INFO L225 Difference]: With dead ends: 452 [2024-11-07 16:10:58,350 INFO L226 Difference]: Without dead ends: 452 [2024-11-07 16:10:58,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-07 16:10:58,353 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 26 mSDsluCounter, 6787 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7050 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:10:58,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7050 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 16:10:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-07 16:10:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2024-11-07 16:10:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 438 states have (on average 1.2625570776255708) internal successors, (553), 441 states have internal predecessors, (553), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:10:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 562 transitions. [2024-11-07 16:10:58,363 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 562 transitions. Word has length 186 [2024-11-07 16:10:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:10:58,363 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 562 transitions. [2024-11-07 16:10:58,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:10:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 562 transitions. [2024-11-07 16:10:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-07 16:10:58,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:10:58,366 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 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, 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:10:58,395 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 (14)] Ended with exit code 0 [2024-11-07 16:10:58,566 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:10:58,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:10:58,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:10:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2142800769, now seen corresponding path program 3 times [2024-11-07 16:10:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:10:58,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82898561] [2024-11-07 16:10:58,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:10:58,568 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:10:58,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:10:58,570 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:10:58,571 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:10:59,175 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 16:10:59,175 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:10:59,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:10:59,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:10:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-07 16:10:59,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:10:59,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:10:59,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82898561] [2024-11-07 16:10:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82898561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:10:59,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:10:59,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:10:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550325556] [2024-11-07 16:10:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:10:59,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:10:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:10:59,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:10:59,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:10:59,467 INFO L87 Difference]: Start difference. First operand 448 states and 562 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:11:03,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:11:07,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:11:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:11:09,856 INFO L93 Difference]: Finished difference Result 539 states and 669 transitions. [2024-11-07 16:11:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:11:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 211 [2024-11-07 16:11:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:11:09,860 INFO L225 Difference]: With dead ends: 539 [2024-11-07 16:11:09,860 INFO L226 Difference]: Without dead ends: 539 [2024-11-07 16:11:09,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:11:09,861 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 398 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:11:09,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 491 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2024-11-07 16:11:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-07 16:11:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2024-11-07 16:11:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 526 states have (on average 1.2490494296577948) internal successors, (657), 529 states have internal predecessors, (657), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-07 16:11:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 666 transitions. [2024-11-07 16:11:09,873 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 666 transitions. Word has length 211 [2024-11-07 16:11:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:11:09,873 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 666 transitions. [2024-11-07 16:11:09,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:11:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 666 transitions. [2024-11-07 16:11:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-07 16:11:09,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:11:09,876 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 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, 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:11:09,890 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:11:10,076 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 [2024-11-07 16:11:10,076 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:11:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:11:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1795377227, now seen corresponding path program 1 times [2024-11-07 16:11:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:11:10,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83867822] [2024-11-07 16:11:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:11:10,079 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:11:10,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:11:10,082 INFO L229 MonitoredProcess]: Starting monitored process 16 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:11:10,084 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 (16)] Waiting until timeout for monitored process [2024-11-07 16:11:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:11:11,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-07 16:11:11,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:11:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-07 16:11:13,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:11:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-07 16:11:20,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:11:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83867822] [2024-11-07 16:11:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83867822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:11:20,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:11:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-07 16:11:20,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330597536] [2024-11-07 16:11:20,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:11:20,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-07 16:11:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:11:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-07 16:11:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-07 16:11:20,124 INFO L87 Difference]: Start difference. First operand 536 states and 666 transitions. Second operand has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)