./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48'] 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_FNV_test3-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:47:30,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:47:30,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 18:47:30,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:47:30,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:47:30,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:47:30,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:47:30,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:47:30,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:47:30,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:47:30,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:47:30,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:47:30,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:47:30,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:47:30,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:47:30,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:47:30,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:47:30,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:47:30,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:47:30,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:47:30,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:47:30,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:47:30,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:47:30,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:47:30,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:47:30,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:47:30,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:47:30,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:47:30,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 18:47:30,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 18:47:30,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:47:30,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:47:30,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:47:30,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:47:30,638 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 [2024-11-07 18:47:30,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:47:30,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:47:30,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:47:30,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:47:30,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:47:30,857 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_FNV_test3-2.i [2024-11-07 18:47:31,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:47:32,220 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:47:32,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2024-11-07 18:47:32,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd615cce9/5fad3eb1578f4f98a37a9b8ec3119f44/FLAG9425b40f4 [2024-11-07 18:47:32,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd615cce9/5fad3eb1578f4f98a37a9b8ec3119f44 [2024-11-07 18:47:32,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:47:32,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:47:32,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:47:32,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:47:32,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:47:32,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:32" (1/1) ... [2024-11-07 18:47:32,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72404711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:32, skipping insertion in model container [2024-11-07 18:47:32,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:32" (1/1) ... [2024-11-07 18:47:32,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:47:32,526 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 18:47:32,546 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 18:47:32,548 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 18:47:32,551 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 18:47:32,554 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 18:47:32,582 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 18:47:32,583 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 18:47:32,584 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 18:47:32,584 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 18:47:32,586 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 18:47:32,587 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 18:47:32,588 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 18:47:32,588 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 18:47:32,590 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 18:47:32,592 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 18:47:32,594 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 18:47:32,594 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 18:47:32,595 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 18:47:32,595 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 18:47:32,597 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 18:47:32,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:47:32,616 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 18:47:32,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@729dc9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:32, skipping insertion in model container [2024-11-07 18:47:32,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:47:32,618 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 18:47:32,619 INFO L158 Benchmark]: Toolchain (without parser) took 359.55ms. Allocated memory is still 100.7MB. Free memory was 74.8MB in the beginning and 54.7MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 18:47:32,619 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 18:47:32,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.21ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 54.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 18:47:32,620 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.18ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.21ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 54.9MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: 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_FNV_test3-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:47:34,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:47:34,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 18:47:34,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:47:34,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:47:34,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:47:34,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:47:34,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:47:34,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:47:34,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:47:34,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:47:34,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:47:34,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:47:34,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:47:34,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:47:34,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:47:34,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 18:47:34,175 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:47:34,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:47:34,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:47:34,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:47:34,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:47:34,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:47:34,177 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 [2024-11-07 18:47:34,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:47:34,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:47:34,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:47:34,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:47:34,412 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:47:34,413 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_FNV_test3-2.i [2024-11-07 18:47:35,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:47:35,748 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:47:35,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2024-11-07 18:47:35,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cecce287/789e52f1b7f04882a62d016473d44daf/FLAG1226710df [2024-11-07 18:47:35,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cecce287/789e52f1b7f04882a62d016473d44daf [2024-11-07 18:47:35,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:47:35,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:47:35,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:47:35,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:47:35,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:47:35,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:35" (1/1) ... [2024-11-07 18:47:35,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6605f52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:35, skipping insertion in model container [2024-11-07 18:47:35,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:35" (1/1) ... [2024-11-07 18:47:35,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:47:36,046 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 18:47:36,067 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 18:47:36,070 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 18:47:36,073 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 18:47:36,078 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 18:47:36,101 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 18:47:36,101 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 18:47:36,103 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 18:47:36,103 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 18:47:36,105 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 18:47:36,106 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 18:47:36,107 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 18:47:36,107 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 18:47:36,111 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 18:47:36,112 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 18:47:36,113 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 18:47:36,114 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 18:47:36,115 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 18:47:36,115 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 18:47:36,118 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 18:47:36,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:47:36,136 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 18:47:36,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:47:36,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 18:47:36,176 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 18:47:36,183 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 18:47:36,185 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 18:47:36,187 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 18:47:36,206 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 18:47:36,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 18:47:36,211 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 18:47:36,211 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 18:47:36,212 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 18:47:36,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 18:47:36,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 18:47:36,216 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 18:47:36,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 18:47:36,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 18:47:36,220 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 18:47:36,220 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 18:47:36,221 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 18:47:36,221 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 18:47:36,228 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 18:47:36,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:47:36,235 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 18:47:36,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:47:36,336 INFO L204 MainTranslator]: Completed translation [2024-11-07 18:47:36,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36 WrapperNode [2024-11-07 18:47:36,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:47:36,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 18:47:36,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 18:47:36,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 18:47:36,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,417 INFO L138 Inliner]: procedures = 180, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1236 [2024-11-07 18:47:36,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 18:47:36,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 18:47:36,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 18:47:36,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 18:47:36,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,519 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 34, 267]. 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, 4, 58]. [2024-11-07 18:47:36,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 18:47:36,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 18:47:36,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 18:47:36,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 18:47:36,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (1/1) ... [2024-11-07 18:47:36,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:47:36,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:47:36,632 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 18:47:36,635 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 18:47:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 18:47:36,656 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 18:47:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 18:47:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 18:47:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 18:47:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 18:47:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 18:47:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 18:47:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 18:47:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 18:47:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 18:47:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 18:47:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 18:47:36,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 18:47:36,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 18:47:36,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 18:47:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 18:47:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 18:47:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 18:47:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 18:47:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 18:47:36,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 18:47:36,855 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 18:47:36,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 18:47:36,888 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:47:36,909 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:47:36,925 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:47:39,592 INFO L? ?]: Removed 1313 outVars from TransFormulas that were not future-live. [2024-11-07 18:47:39,592 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 18:47:39,623 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 18:47:39,626 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-07 18:47:39,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:39 BoogieIcfgContainer [2024-11-07 18:47:39,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 18:47:39,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 18:47:39,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 18:47:39,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 18:47:39,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:47:35" (1/3) ... [2024-11-07 18:47:39,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fefdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:39, skipping insertion in model container [2024-11-07 18:47:39,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:36" (2/3) ... [2024-11-07 18:47:39,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fefdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:39, skipping insertion in model container [2024-11-07 18:47:39,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:39" (3/3) ... [2024-11-07 18:47:39,635 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test3-2.i [2024-11-07 18:47:39,645 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 18:47:39,646 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 632 error locations. [2024-11-07 18:47:39,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 18:47:39,700 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;@2d94438c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 18:47:39,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 632 error locations. [2024-11-07 18:47:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 1275 states, 632 states have (on average 2.231012658227848) internal successors, (1410), 1268 states have internal predecessors, (1410), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 18:47:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 18:47:39,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:39,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 18:47:39,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:39,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-07 18:47:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009179723] [2024-11-07 18:47:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:39,720 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 18:47:39,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:39,722 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 18:47:39,723 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 18:47:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:39,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:47:39,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:39,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:47:39,903 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 18:47:39,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:39,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009179723] [2024-11-07 18:47:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009179723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:39,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:47:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230405540] [2024-11-07 18:47:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:39,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:47:39,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:47:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:47:39,927 INFO L87 Difference]: Start difference. First operand has 1275 states, 632 states have (on average 2.231012658227848) internal successors, (1410), 1268 states have internal predecessors, (1410), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 18:47:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:41,194 INFO L93 Difference]: Finished difference Result 1449 states and 1535 transitions. [2024-11-07 18:47:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:47:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-07 18:47:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:41,207 INFO L225 Difference]: With dead ends: 1449 [2024-11-07 18:47:41,207 INFO L226 Difference]: Without dead ends: 1447 [2024-11-07 18:47:41,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:47:41,209 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1172 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:41,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 943 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 18:47:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-11-07 18:47:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1260. [2024-11-07 18:47:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 634 states have (on average 2.080441640378549) internal successors, (1319), 1253 states have internal predecessors, (1319), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1337 transitions. [2024-11-07 18:47:41,282 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1337 transitions. Word has length 3 [2024-11-07 18:47:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:41,283 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1337 transitions. [2024-11-07 18:47:41,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 18:47:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1337 transitions. [2024-11-07 18:47:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 18:47:41,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:41,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 18:47:41,287 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 18:47:41,485 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 18:47:41,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:41,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-07 18:47:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359774469] [2024-11-07 18:47:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:41,487 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 18:47:41,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:41,488 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 18:47:41,489 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 18:47:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:41,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:47:41,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:41,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:47:41,590 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 18:47:41,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:41,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:41,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359774469] [2024-11-07 18:47:41,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359774469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:41,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:41,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:47:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579851346] [2024-11-07 18:47:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:41,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:47:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:41,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:47:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:47:41,593 INFO L87 Difference]: Start difference. First operand 1260 states and 1337 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 18:47:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:43,483 INFO L93 Difference]: Finished difference Result 1879 states and 2009 transitions. [2024-11-07 18:47:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:47:43,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-07 18:47:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:43,488 INFO L225 Difference]: With dead ends: 1879 [2024-11-07 18:47:43,489 INFO L226 Difference]: Without dead ends: 1879 [2024-11-07 18:47:43,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 18:47:43,491 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 660 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:43,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1749 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 18:47:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2024-11-07 18:47:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1468. [2024-11-07 18:47:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 843 states have (on average 2.0652431791221826) internal successors, (1741), 1461 states have internal predecessors, (1741), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1759 transitions. [2024-11-07 18:47:43,516 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1759 transitions. Word has length 3 [2024-11-07 18:47:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:43,516 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1759 transitions. [2024-11-07 18:47:43,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 18:47:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1759 transitions. [2024-11-07 18:47:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 18:47:43,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:43,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:43,522 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 (3)] Forceful destruction successful, exit code 0 [2024-11-07 18:47:43,719 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 18:47:43,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-07 18:47:43,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:43,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437662895] [2024-11-07 18:47:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:43,720 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 18:47:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:43,722 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 18:47:43,723 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 18:47:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:43,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 18:47:43,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:43,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:47:43,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:47:43,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:47:43,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 18:47:43,893 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 18:47:43,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 18:47:43,914 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 18:47:43,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:43,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437662895] [2024-11-07 18:47:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437662895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:47:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679609014] [2024-11-07 18:47:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:43,916 INFO L87 Difference]: Start difference. First operand 1468 states and 1759 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 18:47:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:45,748 INFO L93 Difference]: Finished difference Result 1649 states and 1951 transitions. [2024-11-07 18:47:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:47:45,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-07 18:47:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:45,753 INFO L225 Difference]: With dead ends: 1649 [2024-11-07 18:47:45,753 INFO L226 Difference]: Without dead ends: 1649 [2024-11-07 18:47:45,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:45,756 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1474 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:45,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 566 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 18:47:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2024-11-07 18:47:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1248. [2024-11-07 18:47:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 634 states have (on average 2.0599369085173502) internal successors, (1306), 1241 states have internal predecessors, (1306), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1324 transitions. [2024-11-07 18:47:45,776 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1324 transitions. Word has length 7 [2024-11-07 18:47:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:45,777 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1324 transitions. [2024-11-07 18:47:45,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 18:47:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1324 transitions. [2024-11-07 18:47:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 18:47:45,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:45,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:45,781 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 (4)] Forceful destruction successful, exit code 0 [2024-11-07 18:47:45,978 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 18:47:45,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:45,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-07 18:47:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:45,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052960528] [2024-11-07 18:47:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:45,980 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 18:47:45,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:45,982 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 18:47:45,983 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 18:47:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:46,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:47:46,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:46,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:47:46,092 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 18:47:46,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:46,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:46,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052960528] [2024-11-07 18:47:46,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052960528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:46,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:46,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:47:46,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591201840] [2024-11-07 18:47:46,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:46,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:47:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:46,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:47:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:47:46,093 INFO L87 Difference]: Start difference. First operand 1248 states and 1324 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 18:47:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:47,738 INFO L93 Difference]: Finished difference Result 1719 states and 1832 transitions. [2024-11-07 18:47:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:47:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-07 18:47:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:47,743 INFO L225 Difference]: With dead ends: 1719 [2024-11-07 18:47:47,743 INFO L226 Difference]: Without dead ends: 1719 [2024-11-07 18:47:47,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 18:47:47,743 INFO L432 NwaCegarLoop]: 1411 mSDtfsCounter, 691 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:47,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1960 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 18:47:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2024-11-07 18:47:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1275. [2024-11-07 18:47:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 671 states have (on average 2.0476900149031296) internal successors, (1374), 1268 states have internal predecessors, (1374), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1392 transitions. [2024-11-07 18:47:47,759 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1392 transitions. Word has length 8 [2024-11-07 18:47:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:47,759 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1392 transitions. [2024-11-07 18:47:47,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 18:47:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1392 transitions. [2024-11-07 18:47:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 18:47:47,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:47,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:47,763 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 (5)] Forceful destruction successful, exit code 0 [2024-11-07 18:47:47,960 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 18:47:47,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:47,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-07 18:47:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654239905] [2024-11-07 18:47:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:47,961 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 18:47:47,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:47,963 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 18:47:47,965 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 18:47:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:48,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:47:48,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:48,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:47:48,063 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 18:47:48,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:48,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654239905] [2024-11-07 18:47:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654239905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:47:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968638185] [2024-11-07 18:47:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:48,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:47:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:47:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:47:48,064 INFO L87 Difference]: Start difference. First operand 1275 states and 1392 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 18:47:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:49,127 INFO L93 Difference]: Finished difference Result 1608 states and 1751 transitions. [2024-11-07 18:47:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:47:49,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-07 18:47:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:49,131 INFO L225 Difference]: With dead ends: 1608 [2024-11-07 18:47:49,131 INFO L226 Difference]: Without dead ends: 1608 [2024-11-07 18:47:49,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 18:47:49,133 INFO L432 NwaCegarLoop]: 1181 mSDtfsCounter, 939 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:49,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1531 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 18:47:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-07 18:47:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1226. [2024-11-07 18:47:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 671 states have (on average 1.9687034277198212) internal successors, (1321), 1219 states have internal predecessors, (1321), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1339 transitions. [2024-11-07 18:47:49,149 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1339 transitions. Word has length 8 [2024-11-07 18:47:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1339 transitions. [2024-11-07 18:47:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 18:47:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1339 transitions. [2024-11-07 18:47:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 18:47:49,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:49,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:49,152 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 (6)] Ended with exit code 0 [2024-11-07 18:47:49,350 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 18:47:49,350 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:49,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:49,351 INFO L85 PathProgramCache]: Analyzing trace with hash -285594881, now seen corresponding path program 1 times [2024-11-07 18:47:49,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:49,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919990287] [2024-11-07 18:47:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:49,351 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 18:47:49,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:49,353 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 18:47:49,353 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 18:47:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:49,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 18:47:49,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:49,506 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 18:47:49,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:49,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:49,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919990287] [2024-11-07 18:47:49,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919990287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:49,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:47:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532452163] [2024-11-07 18:47:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:49,507 INFO L87 Difference]: Start difference. First operand 1226 states and 1339 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 18:47:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:49,970 INFO L93 Difference]: Finished difference Result 1826 states and 2023 transitions. [2024-11-07 18:47:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:47:49,971 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), 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 11 [2024-11-07 18:47:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:49,975 INFO L225 Difference]: With dead ends: 1826 [2024-11-07 18:47:49,975 INFO L226 Difference]: Without dead ends: 1826 [2024-11-07 18:47:49,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 18:47:49,975 INFO L432 NwaCegarLoop]: 1394 mSDtfsCounter, 635 mSDsluCounter, 2419 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 3813 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:49,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 3813 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 18:47:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-11-07 18:47:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1475. [2024-11-07 18:47:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 920 states have (on average 1.940217391304348) internal successors, (1785), 1468 states have internal predecessors, (1785), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1803 transitions. [2024-11-07 18:47:49,993 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1803 transitions. Word has length 11 [2024-11-07 18:47:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:49,994 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1803 transitions. [2024-11-07 18:47:49,994 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), 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 18:47:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1803 transitions. [2024-11-07 18:47:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 18:47:49,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:49,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:49,997 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 18:47:50,194 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 18:47:50,195 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:50,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-07 18:47:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:50,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508053896] [2024-11-07 18:47:50,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:50,196 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 18:47:50,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:50,198 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 18:47:50,200 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 18:47:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:50,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:47:50,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:50,299 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 18:47:50,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:50,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508053896] [2024-11-07 18:47:50,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508053896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:50,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:50,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:47:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453119230] [2024-11-07 18:47:50,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:50,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:47:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:47:50,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:47:50,300 INFO L87 Difference]: Start difference. First operand 1475 states and 1803 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 18:47:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:50,338 INFO L93 Difference]: Finished difference Result 1415 states and 1717 transitions. [2024-11-07 18:47:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:47:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-07 18:47:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:50,342 INFO L225 Difference]: With dead ends: 1415 [2024-11-07 18:47:50,342 INFO L226 Difference]: Without dead ends: 1415 [2024-11-07 18:47:50,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 18:47:50,343 INFO L432 NwaCegarLoop]: 1202 mSDtfsCounter, 71 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:50,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2341 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:47:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-07 18:47:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1415. [2024-11-07 18:47:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 884 states have (on average 1.9219457013574661) internal successors, (1699), 1408 states have internal predecessors, (1699), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1717 transitions. [2024-11-07 18:47:50,360 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1717 transitions. Word has length 13 [2024-11-07 18:47:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:50,360 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1717 transitions. [2024-11-07 18:47:50,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 18:47:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1717 transitions. [2024-11-07 18:47:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 18:47:50,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:50,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:50,368 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 (8)] Forceful destruction successful, exit code 0 [2024-11-07 18:47:50,561 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 18:47:50,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:50,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash -652980110, now seen corresponding path program 1 times [2024-11-07 18:47:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:50,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694971132] [2024-11-07 18:47:50,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:50,562 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 18:47:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:50,564 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 18:47:50,565 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 18:47:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:50,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:47:50,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:50,671 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 18:47:50,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:50,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694971132] [2024-11-07 18:47:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694971132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:50,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:47:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653972329] [2024-11-07 18:47:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:50,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:50,672 INFO L87 Difference]: Start difference. First operand 1415 states and 1717 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 18:47:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:50,736 INFO L93 Difference]: Finished difference Result 1385 states and 1659 transitions. [2024-11-07 18:47:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:47:50,736 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 18:47:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:50,739 INFO L225 Difference]: With dead ends: 1385 [2024-11-07 18:47:50,739 INFO L226 Difference]: Without dead ends: 1385 [2024-11-07 18:47:50,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 18:47:50,740 INFO L432 NwaCegarLoop]: 1157 mSDtfsCounter, 48 mSDsluCounter, 2288 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:50,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3445 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:47:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-07 18:47:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1385. [2024-11-07 18:47:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 868 states have (on average 1.890552995391705) internal successors, (1641), 1378 states have internal predecessors, (1641), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1659 transitions. [2024-11-07 18:47:50,756 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1659 transitions. Word has length 15 [2024-11-07 18:47:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:50,756 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1659 transitions. [2024-11-07 18:47:50,756 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 18:47:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1659 transitions. [2024-11-07 18:47:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 18:47:50,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:50,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:50,761 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 18:47:50,957 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 18:47:50,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr630ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:50,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash 90438054, now seen corresponding path program 1 times [2024-11-07 18:47:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:50,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654219555] [2024-11-07 18:47:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:50,959 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 18:47:50,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:50,961 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 18:47:50,962 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 18:47:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:51,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 18:47:51,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:51,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:47:51,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:47:51,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:47:51,087 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 18:47:51,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 18:47:51,123 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 18:47:51,130 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 18:47:51,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:51,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654219555] [2024-11-07 18:47:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654219555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:51,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:47:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171566888] [2024-11-07 18:47:51,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:51,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:51,131 INFO L87 Difference]: Start difference. First operand 1385 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 18:47:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:51,301 INFO L93 Difference]: Finished difference Result 2441 states and 2823 transitions. [2024-11-07 18:47:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:47:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-07 18:47:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:51,306 INFO L225 Difference]: With dead ends: 2441 [2024-11-07 18:47:51,306 INFO L226 Difference]: Without dead ends: 2441 [2024-11-07 18:47:51,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 18:47:51,307 INFO L432 NwaCegarLoop]: 1159 mSDtfsCounter, 1098 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 3464 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:51,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 3464 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:47:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2024-11-07 18:47:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1384. [2024-11-07 18:47:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 867 states have (on average 1.8904267589388697) internal successors, (1639), 1377 states have internal predecessors, (1639), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1657 transitions. [2024-11-07 18:47:51,329 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1657 transitions. Word has length 16 [2024-11-07 18:47:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:51,329 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1657 transitions. [2024-11-07 18:47:51,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 18:47:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1657 transitions. [2024-11-07 18:47:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 18:47:51,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:51,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:51,334 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 18:47:51,530 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 18:47:51,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:51,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-07 18:47:51,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:51,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854679305] [2024-11-07 18:47:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:51,531 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 18:47:51,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:51,533 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 18:47:51,534 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 18:47:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:51,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:47:51,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:51,667 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 18:47:51,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:51,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:51,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854679305] [2024-11-07 18:47:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854679305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:51,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:51,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:47:51,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907727745] [2024-11-07 18:47:51,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:51,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:47:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:51,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:47:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:47:51,668 INFO L87 Difference]: Start difference. First operand 1384 states and 1657 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:47:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:51,687 INFO L93 Difference]: Finished difference Result 1324 states and 1571 transitions. [2024-11-07 18:47:51,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:47:51,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-07 18:47:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:51,690 INFO L225 Difference]: With dead ends: 1324 [2024-11-07 18:47:51,690 INFO L226 Difference]: Without dead ends: 1324 [2024-11-07 18:47:51,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 18:47:51,691 INFO L432 NwaCegarLoop]: 1124 mSDtfsCounter, 71 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:51,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:47:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2024-11-07 18:47:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2024-11-07 18:47:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 831 states have (on average 1.8688327316486162) internal successors, (1553), 1317 states have internal predecessors, (1553), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1571 transitions. [2024-11-07 18:47:51,705 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1571 transitions. Word has length 18 [2024-11-07 18:47:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:51,705 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1571 transitions. [2024-11-07 18:47:51,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18:47:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1571 transitions. [2024-11-07 18:47:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 18:47:51,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:51,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:51,711 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 18:47:51,906 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 18:47:51,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:51,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-07 18:47:51,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:51,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625771294] [2024-11-07 18:47:51,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:51,908 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 18:47:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:51,910 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 18:47:51,912 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 18:47:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:52,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:47:52,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:52,040 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 18:47:52,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:52,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:52,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625771294] [2024-11-07 18:47:52,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625771294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:52,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:52,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:47:52,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444862138] [2024-11-07 18:47:52,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:52,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:52,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:52,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:52,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:52,041 INFO L87 Difference]: Start difference. First operand 1324 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 18:47:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:52,086 INFO L93 Difference]: Finished difference Result 1294 states and 1513 transitions. [2024-11-07 18:47:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:47:52,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-07 18:47:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:52,089 INFO L225 Difference]: With dead ends: 1294 [2024-11-07 18:47:52,089 INFO L226 Difference]: Without dead ends: 1294 [2024-11-07 18:47:52,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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 18:47:52,089 INFO L432 NwaCegarLoop]: 1079 mSDtfsCounter, 48 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3211 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:52,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3211 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:47:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-11-07 18:47:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2024-11-07 18:47:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 815 states have (on average 1.834355828220859) internal successors, (1495), 1287 states have internal predecessors, (1495), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1513 transitions. [2024-11-07 18:47:52,100 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1513 transitions. Word has length 20 [2024-11-07 18:47:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:52,101 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1513 transitions. [2024-11-07 18:47:52,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 18:47:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1513 transitions. [2024-11-07 18:47:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 18:47:52,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:52,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:52,107 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 18:47:52,302 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 18:47:52,303 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:52,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:52,303 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-07 18:47:52,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:52,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894798189] [2024-11-07 18:47:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:52,303 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 18:47:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:52,305 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 18:47:52,306 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 18:47:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:52,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:47:52,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:52,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:47:52,491 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 18:47:52,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:52,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894798189] [2024-11-07 18:47:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894798189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:52,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:52,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:47:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813227658] [2024-11-07 18:47:52,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:52,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:52,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:52,492 INFO L87 Difference]: Start difference. First operand 1294 states and 1513 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 18:47:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:53,845 INFO L93 Difference]: Finished difference Result 1690 states and 2022 transitions. [2024-11-07 18:47:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:47:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-07 18:47:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:53,849 INFO L225 Difference]: With dead ends: 1690 [2024-11-07 18:47:53,849 INFO L226 Difference]: Without dead ends: 1690 [2024-11-07 18:47:53,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 18:47:53,850 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 794 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:53,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1527 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 18:47:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2024-11-07 18:47:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1290. [2024-11-07 18:47:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 815 states have (on average 1.8245398773006134) internal successors, (1487), 1283 states have internal predecessors, (1487), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1505 transitions. [2024-11-07 18:47:53,860 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1505 transitions. Word has length 34 [2024-11-07 18:47:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:53,860 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1505 transitions. [2024-11-07 18:47:53,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 18:47:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1505 transitions. [2024-11-07 18:47:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 18:47:53,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:53,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:53,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-07 18:47:54,061 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 18:47:54,061 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:54,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-07 18:47:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:54,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714461230] [2024-11-07 18:47:54,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:54,062 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 18:47:54,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:54,064 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 18:47:54,066 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 18:47:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:54,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 18:47:54,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:54,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:47:54,307 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 18:47:54,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:54,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:54,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714461230] [2024-11-07 18:47:54,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714461230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:54,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:47:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669248033] [2024-11-07 18:47:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:54,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:54,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:54,309 INFO L87 Difference]: Start difference. First operand 1290 states and 1505 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 18:47:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:56,135 INFO L93 Difference]: Finished difference Result 1805 states and 2114 transitions. [2024-11-07 18:47:56,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:47:56,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-07 18:47:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:56,139 INFO L225 Difference]: With dead ends: 1805 [2024-11-07 18:47:56,139 INFO L226 Difference]: Without dead ends: 1805 [2024-11-07 18:47:56,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 18:47:56,140 INFO L432 NwaCegarLoop]: 1303 mSDtfsCounter, 542 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:56,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2615 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 18:47:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2024-11-07 18:47:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1286. [2024-11-07 18:47:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 815 states have (on average 1.814723926380368) internal successors, (1479), 1279 states have internal predecessors, (1479), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1497 transitions. [2024-11-07 18:47:56,154 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1497 transitions. Word has length 34 [2024-11-07 18:47:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:56,154 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1497 transitions. [2024-11-07 18:47:56,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 18:47:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1497 transitions. [2024-11-07 18:47:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 18:47:56,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:56,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:47:56,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-07 18:47:56,360 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 18:47:56,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:56,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-07 18:47:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372056950] [2024-11-07 18:47:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:56,361 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 18:47:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:56,363 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 18:47:56,364 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 18:47:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:56,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:47:56,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:56,567 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 18:47:56,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:56,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:56,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372056950] [2024-11-07 18:47:56,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372056950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:56,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:56,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:47:56,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11645946] [2024-11-07 18:47:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:56,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:56,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:56,568 INFO L87 Difference]: Start difference. First operand 1286 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 18:47:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:56,606 INFO L93 Difference]: Finished difference Result 1274 states and 1477 transitions. [2024-11-07 18:47:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:47:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-11-07 18:47:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:56,609 INFO L225 Difference]: With dead ends: 1274 [2024-11-07 18:47:56,609 INFO L226 Difference]: Without dead ends: 1274 [2024-11-07 18:47:56,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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 18:47:56,610 INFO L432 NwaCegarLoop]: 1073 mSDtfsCounter, 21 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3188 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:56,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3188 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:47:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-07 18:47:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2024-11-07 18:47:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 803 states have (on average 1.8169364881693648) internal successors, (1459), 1267 states have internal predecessors, (1459), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1477 transitions. [2024-11-07 18:47:56,621 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1477 transitions. Word has length 53 [2024-11-07 18:47:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:56,622 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1477 transitions. [2024-11-07 18:47:56,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 18:47:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1477 transitions. [2024-11-07 18:47:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 18:47:56,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:56,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:47:56,629 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 (15)] Forceful destruction successful, exit code 0 [2024-11-07 18:47:56,824 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 18:47:56,824 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-07 18:47:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944665074] [2024-11-07 18:47:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:56,825 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 18:47:56,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:56,827 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 18:47:56,827 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 18:47:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:57,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 18:47:57,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:57,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:47:57,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:47:57,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:47:57,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 18:47:57,413 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 18:47:57,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 18:47:57,420 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 18:47:57,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:57,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:57,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944665074] [2024-11-07 18:47:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944665074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:57,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:57,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:47:57,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764127173] [2024-11-07 18:47:57,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:57,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:47:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:47:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:57,421 INFO L87 Difference]: Start difference. First operand 1274 states and 1477 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 18:47:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:47:58,912 INFO L93 Difference]: Finished difference Result 1628 states and 1948 transitions. [2024-11-07 18:47:58,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:47:58,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-07 18:47:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:47:58,916 INFO L225 Difference]: With dead ends: 1628 [2024-11-07 18:47:58,917 INFO L226 Difference]: Without dead ends: 1628 [2024-11-07 18:47:58,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:47:58,917 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 1048 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:47:58,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 890 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 18:47:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-07 18:47:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1199. [2024-11-07 18:47:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 766 states have (on average 1.7584856396866841) internal successors, (1347), 1192 states have internal predecessors, (1347), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:47:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1365 transitions. [2024-11-07 18:47:58,926 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1365 transitions. Word has length 61 [2024-11-07 18:47:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:47:58,926 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1365 transitions. [2024-11-07 18:47:58,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 18:47:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1365 transitions. [2024-11-07 18:47:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 18:47:58,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:47:58,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:47:58,935 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 (16)] Ended with exit code 0 [2024-11-07 18:47:59,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 18:47:59,127 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:47:59,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:47:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-07 18:47:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:47:59,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460638836] [2024-11-07 18:47:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:47:59,128 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 18:47:59,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:47:59,130 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:47:59,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-07 18:47:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:47:59,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 18:47:59,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:47:59,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:47:59,341 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 19 treesize of output 1 [2024-11-07 18:47:59,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 18:47:59,359 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 18:47:59,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:47:59,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:47:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460638836] [2024-11-07 18:47:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460638836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:47:59,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:47:59,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:47:59,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26265966] [2024-11-07 18:47:59,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:47:59,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:47:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:47:59,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:47:59,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:47:59,360 INFO L87 Difference]: Start difference. First operand 1199 states and 1365 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 18:48:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:48:00,799 INFO L93 Difference]: Finished difference Result 1198 states and 1364 transitions. [2024-11-07 18:48:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:48:00,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-07 18:48:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:48:00,802 INFO L225 Difference]: With dead ends: 1198 [2024-11-07 18:48:00,802 INFO L226 Difference]: Without dead ends: 1198 [2024-11-07 18:48:00,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:48:00,803 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 2 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:48:00,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2711 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 18:48:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-07 18:48:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2024-11-07 18:48:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 766 states have (on average 1.7571801566579635) internal successors, (1346), 1191 states have internal predecessors, (1346), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:48:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1364 transitions. [2024-11-07 18:48:00,811 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1364 transitions. Word has length 66 [2024-11-07 18:48:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:48:00,811 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1364 transitions. [2024-11-07 18:48:00,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 18:48:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1364 transitions. [2024-11-07 18:48:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 18:48:00,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:48:00,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:00,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-07 18:48:01,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:48:01,013 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:48:01,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:48:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-07 18:48:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:48:01,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652568862] [2024-11-07 18:48:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:48:01,013 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 18:48:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:48:01,015 INFO L229 MonitoredProcess]: Starting monitored process 18 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 18:48:01,016 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 (18)] Waiting until timeout for monitored process [2024-11-07 18:48:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:48:01,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 18:48:01,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:48:01,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 18:48:01,228 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 13 treesize of output 9 [2024-11-07 18:48:01,233 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 19 treesize of output 1 [2024-11-07 18:48:01,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 18:48:01,268 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 18:48:01,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:48:01,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:48:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652568862] [2024-11-07 18:48:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652568862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:48:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:48:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:48:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356818368] [2024-11-07 18:48:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:48:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:48:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:48:01,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:48:01,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:48:01,271 INFO L87 Difference]: Start difference. First operand 1198 states and 1364 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 18:48:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:48:02,924 INFO L93 Difference]: Finished difference Result 1197 states and 1363 transitions. [2024-11-07 18:48:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:48:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-07 18:48:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:48:02,927 INFO L225 Difference]: With dead ends: 1197 [2024-11-07 18:48:02,927 INFO L226 Difference]: Without dead ends: 1197 [2024-11-07 18:48:02,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 18:48:02,927 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 1 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 18:48:02,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2761 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 18:48:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-11-07 18:48:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2024-11-07 18:48:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 765 states have (on average 1.7581699346405228) internal successors, (1345), 1190 states have internal predecessors, (1345), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 18:48:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1363 transitions. [2024-11-07 18:48:02,936 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1363 transitions. Word has length 66 [2024-11-07 18:48:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:48:02,936 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1363 transitions. [2024-11-07 18:48:02,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 18:48:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1363 transitions. [2024-11-07 18:48:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 18:48:02,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:48:02,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:02,943 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 (18)] Forceful destruction successful, exit code 0 [2024-11-07 18:48:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 18:48:03,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:48:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:48:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 82093638, now seen corresponding path program 1 times [2024-11-07 18:48:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:48:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95728293] [2024-11-07 18:48:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:48:03,138 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 18:48:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:48:03,141 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:48:03,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-07 18:48:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:48:03,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:48:03,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:48:03,360 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 18:48:03,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:48:03,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:48:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95728293] [2024-11-07 18:48:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95728293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:48:03,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:48:03,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:48:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544211360] [2024-11-07 18:48:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:48:03,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:48:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:48:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:48:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:48:03,363 INFO L87 Difference]: Start difference. First operand 1197 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:48:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:48:03,390 INFO L93 Difference]: Finished difference Result 1200 states and 1367 transitions. [2024-11-07 18:48:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:48:03,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-07 18:48:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:48:03,393 INFO L225 Difference]: With dead ends: 1200 [2024-11-07 18:48:03,393 INFO L226 Difference]: Without dead ends: 1200 [2024-11-07 18:48:03,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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 18:48:03,394 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 0 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:48:03,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3133 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:48:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-07 18:48:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1200. [2024-11-07 18:48:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 767 states have (on average 1.757496740547588) internal successors, (1348), 1193 states have internal predecessors, (1348), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 18:48:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1367 transitions. [2024-11-07 18:48:03,421 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1367 transitions. Word has length 74 [2024-11-07 18:48:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:48:03,422 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1367 transitions. [2024-11-07 18:48:03,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 18:48:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1367 transitions. [2024-11-07 18:48:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 18:48:03,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:48:03,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:03,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-07 18:48:03,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:48:03,623 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:48:03,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:48:03,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1038389230, now seen corresponding path program 1 times [2024-11-07 18:48:03,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:48:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339579503] [2024-11-07 18:48:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:48:03,624 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 18:48:03,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:48:03,626 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:48:03,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-07 18:48:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:48:03,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:48:03,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:48:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:48:03,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:48:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:48:03,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:48:03,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339579503] [2024-11-07 18:48:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339579503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:48:03,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:48:03,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 18:48:03,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925272266] [2024-11-07 18:48:03,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:48:03,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 18:48:03,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:48:03,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 18:48:03,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 18:48:03,883 INFO L87 Difference]: Start difference. First operand 1200 states and 1367 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:48:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:48:03,971 INFO L93 Difference]: Finished difference Result 1212 states and 1384 transitions. [2024-11-07 18:48:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 18:48:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-07 18:48:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:48:03,974 INFO L225 Difference]: With dead ends: 1212 [2024-11-07 18:48:03,974 INFO L226 Difference]: Without dead ends: 1212 [2024-11-07 18:48:03,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-07 18:48:03,974 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 7 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:48:03,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3136 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:48:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-07 18:48:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1210. [2024-11-07 18:48:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 776 states have (on average 1.7564432989690721) internal successors, (1363), 1202 states have internal predecessors, (1363), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 18:48:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1382 transitions. [2024-11-07 18:48:03,985 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1382 transitions. Word has length 75 [2024-11-07 18:48:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:48:03,985 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1382 transitions. [2024-11-07 18:48:03,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:48:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1382 transitions. [2024-11-07 18:48:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 18:48:03,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:48:03,985 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:03,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-07 18:48:04,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:48:04,186 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:48:04,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:48:04,186 INFO L85 PathProgramCache]: Analyzing trace with hash 19839302, now seen corresponding path program 2 times [2024-11-07 18:48:04,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:48:04,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743315179] [2024-11-07 18:48:04,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 18:48:04,187 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 18:48:04,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:48:04,189 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:48:04,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-07 18:48:04,567 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 18:48:04,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:48:04,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 18:48:04,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:48:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:48:04,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:48:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:48:04,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:48:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743315179] [2024-11-07 18:48:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743315179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:48:04,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:48:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 18:48:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578770271] [2024-11-07 18:48:04,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:48:04,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 18:48:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:48:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 18:48:04,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 18:48:04,703 INFO L87 Difference]: Start difference. First operand 1210 states and 1382 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:48:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:48:04,962 INFO L93 Difference]: Finished difference Result 1225 states and 1404 transitions. [2024-11-07 18:48:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 18:48:04,963 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-07 18:48:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:48:04,967 INFO L225 Difference]: With dead ends: 1225 [2024-11-07 18:48:04,967 INFO L226 Difference]: Without dead ends: 1221 [2024-11-07 18:48:04,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-07 18:48:04,968 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 11 mSDsluCounter, 5218 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6264 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:48:04,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6264 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:48:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2024-11-07 18:48:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1219. [2024-11-07 18:48:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 785 states have (on average 1.7515923566878981) internal successors, (1375), 1211 states have internal predecessors, (1375), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 18:48:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1394 transitions. [2024-11-07 18:48:04,982 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1394 transitions. Word has length 78 [2024-11-07 18:48:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:48:04,982 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1394 transitions. [2024-11-07 18:48:04,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:48:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1394 transitions. [2024-11-07 18:48:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 18:48:04,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:48:04,982 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:04,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-07 18:48:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:48:05,183 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:48:05,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:48:05,183 INFO L85 PathProgramCache]: Analyzing trace with hash -251722298, now seen corresponding path program 3 times [2024-11-07 18:48:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:48:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535220812] [2024-11-07 18:48:05,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 18:48:05,184 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 18:48:05,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:48:05,186 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:48:05,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-07 18:48:05,774 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-07 18:48:05,774 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:48:05,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 18:48:05,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:48:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:48:05,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:48:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:48:06,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:48:06,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535220812] [2024-11-07 18:48:06,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535220812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:48:06,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:48:06,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 18:48:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071587247] [2024-11-07 18:48:06,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:48:06,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 18:48:06,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:48:06,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 18:48:06,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-07 18:48:06,228 INFO L87 Difference]: Start difference. First operand 1219 states and 1394 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:48:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:48:07,269 INFO L93 Difference]: Finished difference Result 1243 states and 1433 transitions. [2024-11-07 18:48:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 18:48:07,270 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-11-07 18:48:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:48:07,272 INFO L225 Difference]: With dead ends: 1243 [2024-11-07 18:48:07,272 INFO L226 Difference]: Without dead ends: 1237 [2024-11-07 18:48:07,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 18:48:07,273 INFO L432 NwaCegarLoop]: 1047 mSDtfsCounter, 26 mSDsluCounter, 14607 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15654 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:48:07,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15654 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 18:48:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-07 18:48:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1237. [2024-11-07 18:48:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 803 states have (on average 1.7409713574097136) internal successors, (1398), 1229 states have internal predecessors, (1398), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 18:48:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1417 transitions. [2024-11-07 18:48:07,287 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1417 transitions. Word has length 84 [2024-11-07 18:48:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:48:07,287 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1417 transitions. [2024-11-07 18:48:07,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:48:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1417 transitions. [2024-11-07 18:48:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 18:48:07,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:48:07,288 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:07,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-07 18:48:07,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 18:48:07,489 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:48:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:48:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1891991238, now seen corresponding path program 4 times [2024-11-07 18:48:07,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:48:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567017654] [2024-11-07 18:48:07,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 18:48:07,490 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 18:48:07,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:48:07,492 INFO L229 MonitoredProcess]: Starting monitored process 23 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 18:48:07,493 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 (23)] Waiting until timeout for monitored process [2024-11-07 18:48:07,863 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 18:48:07,863 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:48:07,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 18:48:07,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:48:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:48:08,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:48:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 18:48:09,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:48:09,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567017654] [2024-11-07 18:48:09,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567017654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:48:09,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:48:09,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-07 18:48:09,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070541684] [2024-11-07 18:48:09,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:48:09,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 18:48:09,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:48:09,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 18:48:09,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 18:48:09,022 INFO L87 Difference]: Start difference. First operand 1237 states and 1417 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:48:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:48:12,739 INFO L93 Difference]: Finished difference Result 1277 states and 1489 transitions. [2024-11-07 18:48:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-07 18:48:12,740 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-07 18:48:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:48:12,742 INFO L225 Difference]: With dead ends: 1277 [2024-11-07 18:48:12,742 INFO L226 Difference]: Without dead ends: 1273 [2024-11-07 18:48:12,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-07 18:48:12,744 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 34 mSDsluCounter, 26074 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 27120 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:48:12,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 27120 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 18:48:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2024-11-07 18:48:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1271. [2024-11-07 18:48:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 837 states have (on average 1.7252090800477897) internal successors, (1444), 1263 states have internal predecessors, (1444), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-07 18:48:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1463 transitions. [2024-11-07 18:48:12,754 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1463 transitions. Word has length 96 [2024-11-07 18:48:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:48:12,754 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1463 transitions. [2024-11-07 18:48:12,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 18:48:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1463 transitions. [2024-11-07 18:48:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 18:48:12,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:48:12,755 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:12,766 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 (23)] Forceful destruction successful, exit code 0 [2024-11-07 18:48:12,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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 18:48:12,956 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 629 more)] === [2024-11-07 18:48:12,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:48:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1497303226, now seen corresponding path program 5 times [2024-11-07 18:48:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:48:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712328516] [2024-11-07 18:48:12,957 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 18:48:12,957 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 18:48:12,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:48:12,959 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 18:48:12,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-07 18:48:13,905 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-07 18:48:13,905 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:48:13,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-07 18:48:13,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:48:13,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 18:48:13,999 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-07 18:48:13,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-07 18:48:14,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 18:48:14,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-07 18:48:14,695 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-07 18:48:14,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-07 18:48:14,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-07 18:48:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 18:48:14,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:48:15,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:48:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712328516] [2024-11-07 18:48:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712328516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 18:48:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1463736666] [2024-11-07 18:48:15,008 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 18:48:15,008 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 18:48:15,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 18:48:15,011 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 18:48:15,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process