./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-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_JEN_test10-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', '3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e'] 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_JEN_test10-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 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:50:14,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:50:14,932 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:50:14,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:50:14,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:50:14,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:50:14,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:50:14,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:50:14,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:50:14,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:50:14,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:50:14,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:50:14,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:50:14,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:50:14,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:50:14,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:50:14,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:50:14,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:50:14,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:50:14,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:50:14,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:50:14,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:50:14,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:50:14,970 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 -> 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e [2024-11-07 18:50:15,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:50:15,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:50:15,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:50:15,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:50:15,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:50:15,284 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_JEN_test10-2.i [2024-11-07 18:50:16,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:50:16,927 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:50:16,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2024-11-07 18:50:16,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0445c4c85/73a7e36a98174c0cb100cf6707c73770/FLAGa577a41e1 [2024-11-07 18:50:17,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0445c4c85/73a7e36a98174c0cb100cf6707c73770 [2024-11-07 18:50:17,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:50:17,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:50:17,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:50:17,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:50:17,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:50:17,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:17" (1/1) ... [2024-11-07 18:50:17,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2d180e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:17, skipping insertion in model container [2024-11-07 18:50:17,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:17" (1/1) ... [2024-11-07 18:50:17,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:50:17,636 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:50:17,671 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:50:17,675 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:50:17,681 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:50:17,690 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:50:17,730 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:50:17,736 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:50:17,739 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:50:17,747 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:50:17,770 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:50:17,771 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:50:17,773 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:50:17,773 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:50:17,790 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:50:17,790 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:50:17,792 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:50:17,792 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:50:17,802 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:50:17,802 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:50:17,804 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:50:17,804 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:50:17,814 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:50:17,815 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:50:17,816 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:50:17,816 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:50:17,817 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:50:17,819 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:50:17,820 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:50:17,821 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:50:17,821 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:50:17,826 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:50:17,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:50:17,853 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:50:17,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@22dbb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:17, skipping insertion in model container [2024-11-07 18:50:17,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:50:17,854 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 18:50:17,855 INFO L158 Benchmark]: Toolchain (without parser) took 673.61ms. Allocated memory is still 100.7MB. Free memory was 74.2MB in the beginning and 45.7MB in the end (delta: 28.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 18:50:17,856 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 18:50:17,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.81ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 45.7MB in the end (delta: 28.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 18:50:17,858 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.21ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.81ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 45.7MB in the end (delta: 28.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: 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_JEN_test10-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 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 18:50:19,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 18:50:19,907 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:50:19,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 18:50:19,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 18:50:19,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 18:50:19,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 18:50:19,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 18:50:19,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 18:50:19,943 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 18:50:19,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 18:50:19,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 18:50:19,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 18:50:19,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 18:50:19,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 18:50:19,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 18:50:19,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 18:50:19,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 18:50:19,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 18:50:19,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 18:50:19,945 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 18:50:19,945 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 18:50:19,945 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 18:50:19,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 18:50:19,946 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 18:50:19,946 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 18:50:19,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 18:50:19,947 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 18:50:19,947 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 18:50:19,947 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 18:50:19,947 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 18:50:19,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 18:50:19,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 18:50:19,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 18:50:19,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 18:50:19,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:50:19,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 18:50:19,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 18:50:19,948 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 18:50:19,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 18:50:19,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 18:50:19,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 18:50:19,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 18:50:19,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 18:50:19,949 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 -> 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e [2024-11-07 18:50:20,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 18:50:20,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 18:50:20,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 18:50:20,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 18:50:20,231 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 18:50:20,233 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_JEN_test10-2.i [2024-11-07 18:50:21,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 18:50:21,618 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-07 18:50:21,912 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 18:50:21,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2024-11-07 18:50:21,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6d5ee959/330ac5786cd5448396368bdcc2bc2b35/FLAGa7004398d [2024-11-07 18:50:21,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6d5ee959/330ac5786cd5448396368bdcc2bc2b35 [2024-11-07 18:50:21,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 18:50:21,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 18:50:21,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 18:50:21,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 18:50:21,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 18:50:21,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:21" (1/1) ... [2024-11-07 18:50:21,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5429bc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:21, skipping insertion in model container [2024-11-07 18:50:21,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:21" (1/1) ... [2024-11-07 18:50:22,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:50:22,420 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:50:22,460 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 18:50:22,464 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:50:22,469 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:50:22,474 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:50:22,507 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:50:22,511 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:50:22,513 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:50:22,520 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:50:22,547 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:50:22,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:50:22,552 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:50:22,552 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:50:22,571 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:50:22,573 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:50:22,575 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:50:22,575 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:50:22,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:50:22,593 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:50:22,596 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:50:22,599 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:50:22,611 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:50:22,611 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:50:22,613 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:50:22,613 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:50:22,614 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:50:22,616 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:50:22,619 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:50:22,620 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:50:22,620 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:50:22,626 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:50:22,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:50:22,654 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 18:50:22,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 18:50:22,717 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:50:22,733 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:50:22,736 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:50:22,738 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:50:22,742 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:50:22,779 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:50:22,780 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:50:22,781 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:50:22,786 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:50:22,803 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:50:22,804 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:50:22,806 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:50:22,806 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:50:22,815 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:50:22,815 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:50:22,817 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:50:22,821 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:50:22,829 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:50:22,829 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:50:22,831 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:50:22,831 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:50:22,836 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:50:22,836 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:50:22,838 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:50:22,838 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:50:22,839 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:50:22,840 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:50:22,840 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:50:22,841 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:50:22,842 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:50:22,844 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:50:22,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:50:22,853 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 18:50:22,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 18:50:23,018 INFO L204 MainTranslator]: Completed translation [2024-11-07 18:50:23,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23 WrapperNode [2024-11-07 18:50:23,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 18:50:23,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 18:50:23,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 18:50:23,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 18:50:23,025 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:50:23" (1/1) ... [2024-11-07 18:50:23,072 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:50:23" (1/1) ... [2024-11-07 18:50:23,155 INFO L138 Inliner]: procedures = 180, calls = 558, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2439 [2024-11-07 18:50:23,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 18:50:23,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 18:50:23,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 18:50:23,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 18:50:23,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,337 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [420, 2, 106]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 94 writes are split as follows [90, 0, 4]. [2024-11-07 18:50:23,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 18:50:23,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 18:50:23,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 18:50:23,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 18:50:23,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (1/1) ... [2024-11-07 18:50:23,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 18:50:23,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 18:50:23,508 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:50:23,515 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:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 18:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 18:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 18:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-07 18:50:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-07 18:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 18:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 18:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 18:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 18:50:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 18:50:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 18:50:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 18:50:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 18:50:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 18:50:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 18:50:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 18:50:23,896 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 18:50:23,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 18:50:23,959 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:50:23,990 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:50:24,020 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 18:50:30,974 INFO L? ?]: Removed 2232 outVars from TransFormulas that were not future-live. [2024-11-07 18:50:30,975 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 18:50:31,043 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 18:50:31,043 INFO L316 CfgBuilder]: Removed 160 assume(true) statements. [2024-11-07 18:50:31,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:31 BoogieIcfgContainer [2024-11-07 18:50:31,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 18:50:31,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 18:50:31,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 18:50:31,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 18:50:31,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:50:21" (1/3) ... [2024-11-07 18:50:31,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18058910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:31, skipping insertion in model container [2024-11-07 18:50:31,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:23" (2/3) ... [2024-11-07 18:50:31,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18058910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:31, skipping insertion in model container [2024-11-07 18:50:31,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:31" (3/3) ... [2024-11-07 18:50:31,064 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-2.i [2024-11-07 18:50:31,078 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 18:50:31,079 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1091 error locations. [2024-11-07 18:50:31,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 18:50:31,178 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;@6813b519, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 18:50:31,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1091 error locations. [2024-11-07 18:50:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 2277 states, 1174 states have (on average 2.1873935264054514) internal successors, (2568), 2263 states have internal predecessors, (2568), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 18:50:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 18:50:31,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:31,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 18:50:31,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:31,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-07 18:50:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:31,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152656308] [2024-11-07 18:50:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:31,210 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:50:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:31,214 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:50:31,215 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:50:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:31,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:50:31,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:31,445 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:50:31,460 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:50:31,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:31,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:31,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152656308] [2024-11-07 18:50:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152656308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:31,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:31,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:50:31,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188263823] [2024-11-07 18:50:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:31,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:31,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:31,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:31,494 INFO L87 Difference]: Start difference. First operand has 2277 states, 1174 states have (on average 2.1873935264054514) internal successors, (2568), 2263 states have internal predecessors, (2568), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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:50:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:34,685 INFO L93 Difference]: Finished difference Result 2941 states and 3125 transitions. [2024-11-07 18:50:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:34,686 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:50:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:34,710 INFO L225 Difference]: With dead ends: 2941 [2024-11-07 18:50:34,710 INFO L226 Difference]: Without dead ends: 2939 [2024-11-07 18:50:34,712 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:50:34,714 INFO L432 NwaCegarLoop]: 1401 mSDtfsCounter, 2142 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:34,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1880 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 18:50:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2024-11-07 18:50:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2421. [2024-11-07 18:50:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 1346 states have (on average 2.0222882615156017) internal successors, (2722), 2405 states have internal predecessors, (2722), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 18:50:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 2754 transitions. [2024-11-07 18:50:34,843 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 2754 transitions. Word has length 3 [2024-11-07 18:50:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:34,843 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 2754 transitions. [2024-11-07 18:50:34,843 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:50:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2754 transitions. [2024-11-07 18:50:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 18:50:34,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:34,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 18:50:34,848 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:50:35,046 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:50:35,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:35,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:35,047 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-07 18:50:35,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:35,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613686015] [2024-11-07 18:50:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:35,048 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:50:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:35,050 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:50:35,051 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:50:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:35,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:50:35,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:35,207 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:50:35,219 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:50:35,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:35,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:35,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613686015] [2024-11-07 18:50:35,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613686015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:35,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:35,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:50:35,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358523192] [2024-11-07 18:50:35,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:35,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:35,223 INFO L87 Difference]: Start difference. First operand 2421 states and 2754 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:50:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:39,859 INFO L93 Difference]: Finished difference Result 3222 states and 3635 transitions. [2024-11-07 18:50:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:39,860 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:50:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:39,871 INFO L225 Difference]: With dead ends: 3222 [2024-11-07 18:50:39,871 INFO L226 Difference]: Without dead ends: 3222 [2024-11-07 18:50:39,872 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:50:39,873 INFO L432 NwaCegarLoop]: 2039 mSDtfsCounter, 875 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:39,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 3347 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-07 18:50:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2024-11-07 18:50:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 2894. [2024-11-07 18:50:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 1817 states have (on average 1.9796367638965326) internal successors, (3597), 2875 states have internal predecessors, (3597), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 18:50:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3635 transitions. [2024-11-07 18:50:39,947 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3635 transitions. Word has length 3 [2024-11-07 18:50:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:39,947 INFO L471 AbstractCegarLoop]: Abstraction has 2894 states and 3635 transitions. [2024-11-07 18:50:39,947 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:50:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3635 transitions. [2024-11-07 18:50:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 18:50:39,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:39,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:39,951 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:50:40,148 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:50:40,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:40,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash 703308354, now seen corresponding path program 1 times [2024-11-07 18:50:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290874263] [2024-11-07 18:50:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:40,153 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:50:40,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:40,157 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:50:40,163 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:50:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:40,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 18:50:40,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:40,371 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:50:40,376 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:50:40,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:50:40,441 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:50:40,454 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 18:50:40,455 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:50:40,476 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:50:40,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:40,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:40,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290874263] [2024-11-07 18:50:40,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290874263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:40,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:40,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:40,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135332749] [2024-11-07 18:50:40,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:40,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:40,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:40,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:40,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:40,478 INFO L87 Difference]: Start difference. First operand 2894 states and 3635 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:50:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:46,364 INFO L93 Difference]: Finished difference Result 5159 states and 6050 transitions. [2024-11-07 18:50:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:50:46,364 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:50:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:46,382 INFO L225 Difference]: With dead ends: 5159 [2024-11-07 18:50:46,383 INFO L226 Difference]: Without dead ends: 5159 [2024-11-07 18:50:46,383 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:50:46,384 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 4330 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4339 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:46,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4339 Valid, 2423 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-07 18:50:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5159 states. [2024-11-07 18:50:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5159 to 3614. [2024-11-07 18:50:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 2537 states have (on average 2.011430823807647) internal successors, (5103), 3589 states have internal predecessors, (5103), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5153 transitions. [2024-11-07 18:50:46,485 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5153 transitions. Word has length 7 [2024-11-07 18:50:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:46,485 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 5153 transitions. [2024-11-07 18:50:46,486 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:50:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5153 transitions. [2024-11-07 18:50:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 18:50:46,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:46,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:46,494 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:50:46,693 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:50:46,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:46,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-07 18:50:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:46,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555390659] [2024-11-07 18:50:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:46,695 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:50:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:46,698 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:50:46,699 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:50:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:46,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:50:46,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:46,870 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:50:46,880 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:50:46,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:46,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555390659] [2024-11-07 18:50:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555390659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:46,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:46,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:50:46,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69869422] [2024-11-07 18:50:46,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:46,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:46,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:46,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:46,882 INFO L87 Difference]: Start difference. First operand 3614 states and 5153 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:50:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:49,088 INFO L93 Difference]: Finished difference Result 4326 states and 5823 transitions. [2024-11-07 18:50:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:49,088 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:50:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:49,101 INFO L225 Difference]: With dead ends: 4326 [2024-11-07 18:50:49,101 INFO L226 Difference]: Without dead ends: 4326 [2024-11-07 18:50:49,101 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:50:49,102 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 1920 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:49,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 2901 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 18:50:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2024-11-07 18:50:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 3522. [2024-11-07 18:50:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 2537 states have (on average 1.9266850610957824) internal successors, (4888), 3497 states have internal predecessors, (4888), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4938 transitions. [2024-11-07 18:50:49,194 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4938 transitions. Word has length 8 [2024-11-07 18:50:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:49,195 INFO L471 AbstractCegarLoop]: Abstraction has 3522 states and 4938 transitions. [2024-11-07 18:50:49,195 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:50:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4938 transitions. [2024-11-07 18:50:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 18:50:49,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:49,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:49,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 18:50:49,399 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:50:49,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-07 18:50:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794288041] [2024-11-07 18:50:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:49,401 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:50:49,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:49,403 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:50:49,404 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:50:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:49,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:50:49,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:49,554 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:50:49,571 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:50:49,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:49,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794288041] [2024-11-07 18:50:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794288041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:49,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:49,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 18:50:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250650235] [2024-11-07 18:50:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:49,572 INFO L87 Difference]: Start difference. First operand 3522 states and 4938 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:50:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:52,749 INFO L93 Difference]: Finished difference Result 5327 states and 7398 transitions. [2024-11-07 18:50:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:52,749 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:50:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:52,761 INFO L225 Difference]: With dead ends: 5327 [2024-11-07 18:50:52,761 INFO L226 Difference]: Without dead ends: 5327 [2024-11-07 18:50:52,761 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:50:52,761 INFO L432 NwaCegarLoop]: 2577 mSDtfsCounter, 1423 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:52,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3684 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-07 18:50:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5327 states. [2024-11-07 18:50:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5327 to 3866. [2024-11-07 18:50:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 2891 states have (on average 1.9121411276374958) internal successors, (5528), 3841 states have internal predecessors, (5528), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 5578 transitions. [2024-11-07 18:50:52,838 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 5578 transitions. Word has length 8 [2024-11-07 18:50:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:52,838 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 5578 transitions. [2024-11-07 18:50:52,838 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:50:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 5578 transitions. [2024-11-07 18:50:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 18:50:52,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:52,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:52,843 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:50:53,039 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:50:53,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -582246585, now seen corresponding path program 1 times [2024-11-07 18:50:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396831644] [2024-11-07 18:50:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:53,040 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:50:53,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:53,042 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:50:53,044 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:50:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:53,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:50:53,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:53,209 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:50:53,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:53,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:53,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396831644] [2024-11-07 18:50:53,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396831644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:53,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:53,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675226981] [2024-11-07 18:50:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:53,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:53,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:53,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:53,210 INFO L87 Difference]: Start difference. First operand 3866 states and 5578 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:50:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:53,246 INFO L93 Difference]: Finished difference Result 3806 states and 5492 transitions. [2024-11-07 18:50:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:53,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:50:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:53,256 INFO L225 Difference]: With dead ends: 3806 [2024-11-07 18:50:53,256 INFO L226 Difference]: Without dead ends: 3806 [2024-11-07 18:50:53,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:50:53,257 INFO L432 NwaCegarLoop]: 2231 mSDtfsCounter, 71 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4399 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:50:53,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4399 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2024-11-07 18:50:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3806. [2024-11-07 18:50:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 2855 states have (on average 1.9061295971978984) internal successors, (5442), 3781 states have internal predecessors, (5442), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 5492 transitions. [2024-11-07 18:50:53,311 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 5492 transitions. Word has length 11 [2024-11-07 18:50:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:53,311 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 5492 transitions. [2024-11-07 18:50:53,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:50:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 5492 transitions. [2024-11-07 18:50:53,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 18:50:53,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:53,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 18:50:53,316 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:50:53,512 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:50:53,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:53,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:53,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1193166111, now seen corresponding path program 1 times [2024-11-07 18:50:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165937704] [2024-11-07 18:50:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:53,514 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:50:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:53,516 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:50:53,517 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:50:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:53,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:50:53,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:53,713 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:50:53,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:53,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165937704] [2024-11-07 18:50:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165937704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:53,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:53,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:50:53,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238604621] [2024-11-07 18:50:53,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:53,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:53,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:53,715 INFO L87 Difference]: Start difference. First operand 3806 states and 5492 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:50:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:53,813 INFO L93 Difference]: Finished difference Result 3776 states and 5434 transitions. [2024-11-07 18:50:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:50:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:50:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:53,831 INFO L225 Difference]: With dead ends: 3776 [2024-11-07 18:50:53,831 INFO L226 Difference]: Without dead ends: 3776 [2024-11-07 18:50:53,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:50:53,835 INFO L432 NwaCegarLoop]: 2186 mSDtfsCounter, 48 mSDsluCounter, 4346 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6532 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:53,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6532 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:50:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2024-11-07 18:50:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3776. [2024-11-07 18:50:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 2839 states have (on average 1.896442409299049) internal successors, (5384), 3751 states have internal predecessors, (5384), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 5434 transitions. [2024-11-07 18:50:53,900 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 5434 transitions. Word has length 13 [2024-11-07 18:50:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:53,900 INFO L471 AbstractCegarLoop]: Abstraction has 3776 states and 5434 transitions. [2024-11-07 18:50:53,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:50:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 5434 transitions. [2024-11-07 18:50:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 18:50:53,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:53,901 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:50:53,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 18:50:54,101 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:50:54,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -555227553, now seen corresponding path program 1 times [2024-11-07 18:50:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867694666] [2024-11-07 18:50:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:54,103 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:50:54,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:54,104 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:50:54,106 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:50:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:54,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:50:54,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:54,287 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:50:54,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:54,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:54,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867694666] [2024-11-07 18:50:54,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867694666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:54,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:54,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291076746] [2024-11-07 18:50:54,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:54,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:54,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:54,289 INFO L87 Difference]: Start difference. First operand 3776 states and 5434 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:50:54,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:54,341 INFO L93 Difference]: Finished difference Result 3644 states and 5176 transitions. [2024-11-07 18:50:54,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:54,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:50:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:54,349 INFO L225 Difference]: With dead ends: 3644 [2024-11-07 18:50:54,349 INFO L226 Difference]: Without dead ends: 3644 [2024-11-07 18:50:54,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:50:54,350 INFO L432 NwaCegarLoop]: 2153 mSDtfsCounter, 71 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4243 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:50:54,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4243 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:54,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2024-11-07 18:50:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3644. [2024-11-07 18:50:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 2731 states have (on average 1.876968143537166) internal successors, (5126), 3619 states have internal predecessors, (5126), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 5176 transitions. [2024-11-07 18:50:54,393 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 5176 transitions. Word has length 20 [2024-11-07 18:50:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:54,393 INFO L471 AbstractCegarLoop]: Abstraction has 3644 states and 5176 transitions. [2024-11-07 18:50:54,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:50:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 5176 transitions. [2024-11-07 18:50:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 18:50:54,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:54,394 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:50:54,400 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:50:54,595 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:50:54,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:54,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash -286362849, now seen corresponding path program 1 times [2024-11-07 18:50:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:54,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701767546] [2024-11-07 18:50:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:54,596 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:50:54,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:54,598 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:50:54,599 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:50:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:54,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 18:50:54,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:54,805 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:50:54,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:54,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701767546] [2024-11-07 18:50:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701767546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:54,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310570563] [2024-11-07 18:50:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:54,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:50:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:50:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:50:54,806 INFO L87 Difference]: Start difference. First operand 3644 states and 5176 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:50:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:54,835 INFO L93 Difference]: Finished difference Result 3584 states and 5090 transitions. [2024-11-07 18:50:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:50:54,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:50:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:54,843 INFO L225 Difference]: With dead ends: 3584 [2024-11-07 18:50:54,843 INFO L226 Difference]: Without dead ends: 3584 [2024-11-07 18:50:54,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:50:54,844 INFO L432 NwaCegarLoop]: 2110 mSDtfsCounter, 71 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4157 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:50:54,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4157 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2024-11-07 18:50:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3584. [2024-11-07 18:50:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 2695 states have (on average 1.87012987012987) internal successors, (5040), 3559 states have internal predecessors, (5040), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5090 transitions. [2024-11-07 18:50:54,906 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5090 transitions. Word has length 20 [2024-11-07 18:50:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:54,906 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5090 transitions. [2024-11-07 18:50:54,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:50:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5090 transitions. [2024-11-07 18:50:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 18:50:54,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:54,908 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] [2024-11-07 18:50:54,913 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:50:55,108 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:50:55,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:55,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash -997708103, now seen corresponding path program 1 times [2024-11-07 18:50:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:55,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83739430] [2024-11-07 18:50:55,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:55,110 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:50:55,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:55,111 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:50:55,112 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:50:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:55,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:50:55,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:55,301 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:50:55,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:55,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:55,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83739430] [2024-11-07 18:50:55,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83739430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:55,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:55,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:50:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198980018] [2024-11-07 18:50:55,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:55,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:55,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:55,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:55,302 INFO L87 Difference]: Start difference. First operand 3584 states and 5090 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:50:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:55,361 INFO L93 Difference]: Finished difference Result 3522 states and 4916 transitions. [2024-11-07 18:50:55,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:50:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-07 18:50:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:55,367 INFO L225 Difference]: With dead ends: 3522 [2024-11-07 18:50:55,368 INFO L226 Difference]: Without dead ends: 3522 [2024-11-07 18:50:55,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:50:55,368 INFO L432 NwaCegarLoop]: 2065 mSDtfsCounter, 48 mSDsluCounter, 4104 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6169 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:50:55,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6169 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2024-11-07 18:50:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3522. [2024-11-07 18:50:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 2647 states have (on average 1.8383075179448432) internal successors, (4866), 3497 states have internal predecessors, (4866), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4916 transitions. [2024-11-07 18:50:55,419 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4916 transitions. Word has length 22 [2024-11-07 18:50:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:55,419 INFO L471 AbstractCegarLoop]: Abstraction has 3522 states and 4916 transitions. [2024-11-07 18:50:55,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:50:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4916 transitions. [2024-11-07 18:50:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 18:50:55,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:55,420 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] [2024-11-07 18:50:55,425 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:50:55,620 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:50:55,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:55,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash -316792903, now seen corresponding path program 1 times [2024-11-07 18:50:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97326897] [2024-11-07 18:50:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:55,622 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:50:55,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:55,625 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:50:55,626 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:50:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:55,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:50:55,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:55,838 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:50:55,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:55,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:55,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97326897] [2024-11-07 18:50:55,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97326897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:55,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:55,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:50:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544493158] [2024-11-07 18:50:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:55,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:55,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:55,840 INFO L87 Difference]: Start difference. First operand 3522 states and 4916 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:50:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:55,914 INFO L93 Difference]: Finished difference Result 3492 states and 4858 transitions. [2024-11-07 18:50:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:50:55,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-07 18:50:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:55,921 INFO L225 Difference]: With dead ends: 3492 [2024-11-07 18:50:55,922 INFO L226 Difference]: Without dead ends: 3492 [2024-11-07 18:50:55,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:50:55,922 INFO L432 NwaCegarLoop]: 2030 mSDtfsCounter, 48 mSDsluCounter, 4034 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6064 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:50:55,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6064 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:50:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2024-11-07 18:50:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3492. [2024-11-07 18:50:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3492 states, 2631 states have (on average 1.8274420372481945) internal successors, (4808), 3467 states have internal predecessors, (4808), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 4858 transitions. [2024-11-07 18:50:55,966 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 4858 transitions. Word has length 22 [2024-11-07 18:50:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:55,966 INFO L471 AbstractCegarLoop]: Abstraction has 3492 states and 4858 transitions. [2024-11-07 18:50:55,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:50:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 4858 transitions. [2024-11-07 18:50:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 18:50:55,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:55,967 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] [2024-11-07 18:50:55,972 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:50:56,167 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:50:56,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:56,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash -544433649, now seen corresponding path program 1 times [2024-11-07 18:50:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825805517] [2024-11-07 18:50:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:56,169 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:50:56,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:56,172 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:50:56,175 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:50:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:56,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:50:56,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:56,351 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:50:56,417 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:50:56,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:56,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:56,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825805517] [2024-11-07 18:50:56,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825805517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:56,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:56,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743784257] [2024-11-07 18:50:56,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:56,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:56,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:56,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:56,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:56,421 INFO L87 Difference]: Start difference. First operand 3492 states and 4858 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:50:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:50:58,850 INFO L93 Difference]: Finished difference Result 3939 states and 5212 transitions. [2024-11-07 18:50:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:50:58,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-07 18:50:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:50:58,856 INFO L225 Difference]: With dead ends: 3939 [2024-11-07 18:50:58,856 INFO L226 Difference]: Without dead ends: 3939 [2024-11-07 18:50:58,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:50:58,857 INFO L432 NwaCegarLoop]: 1250 mSDtfsCounter, 1835 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1845 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:50:58,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1845 Valid, 2810 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 18:50:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2024-11-07 18:50:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3488. [2024-11-07 18:50:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 2631 states have (on average 1.8244013683010263) internal successors, (4800), 3463 states have internal predecessors, (4800), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:50:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4850 transitions. [2024-11-07 18:50:58,900 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4850 transitions. Word has length 27 [2024-11-07 18:50:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:50:58,900 INFO L471 AbstractCegarLoop]: Abstraction has 3488 states and 4850 transitions. [2024-11-07 18:50:58,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:50:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4850 transitions. [2024-11-07 18:50:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 18:50:58,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:50:58,903 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] [2024-11-07 18:50:58,907 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:50:59,103 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:50:59,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:50:59,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:50:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash -544433648, now seen corresponding path program 1 times [2024-11-07 18:50:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:50:59,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147204791] [2024-11-07 18:50:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:50:59,104 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:50:59,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:50:59,106 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:50:59,107 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:50:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:50:59,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 18:50:59,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:50:59,316 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:50:59,453 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:50:59,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:50:59,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:50:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147204791] [2024-11-07 18:50:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147204791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:50:59,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:50:59,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:50:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330984161] [2024-11-07 18:50:59,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:50:59,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:50:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:50:59,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:50:59,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:50:59,454 INFO L87 Difference]: Start difference. First operand 3488 states and 4850 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:51:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:02,825 INFO L93 Difference]: Finished difference Result 4222 states and 5656 transitions. [2024-11-07 18:51:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-07 18:51:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:02,829 INFO L225 Difference]: With dead ends: 4222 [2024-11-07 18:51:02,830 INFO L226 Difference]: Without dead ends: 4222 [2024-11-07 18:51:02,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:51:02,830 INFO L432 NwaCegarLoop]: 1741 mSDtfsCounter, 806 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:02,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 3923 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-07 18:51:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2024-11-07 18:51:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3524. [2024-11-07 18:51:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3524 states, 2667 states have (on average 1.8151481064866892) internal successors, (4841), 3499 states have internal predecessors, (4841), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:51:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4891 transitions. [2024-11-07 18:51:02,864 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4891 transitions. Word has length 27 [2024-11-07 18:51:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:02,864 INFO L471 AbstractCegarLoop]: Abstraction has 3524 states and 4891 transitions. [2024-11-07 18:51:02,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:51:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4891 transitions. [2024-11-07 18:51:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 18:51:02,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:02,865 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] [2024-11-07 18:51:02,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-07 18:51:03,066 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:51:03,066 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:03,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:03,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826599, now seen corresponding path program 1 times [2024-11-07 18:51:03,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:03,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958608608] [2024-11-07 18:51:03,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:03,068 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:51:03,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:03,071 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:51:03,073 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:51:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:03,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:51:03,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:03,274 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:51:03,339 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:51:03,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:03,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:03,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958608608] [2024-11-07 18:51:03,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958608608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:03,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:03,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058686601] [2024-11-07 18:51:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:03,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:03,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:03,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:03,340 INFO L87 Difference]: Start difference. First operand 3524 states and 4891 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:51:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:06,124 INFO L93 Difference]: Finished difference Result 4240 states and 5655 transitions. [2024-11-07 18:51:06,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:06,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-07 18:51:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:06,129 INFO L225 Difference]: With dead ends: 4240 [2024-11-07 18:51:06,129 INFO L226 Difference]: Without dead ends: 4240 [2024-11-07 18:51:06,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:51:06,129 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 1691 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:06,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 4201 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 18:51:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2024-11-07 18:51:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 3520. [2024-11-07 18:51:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2667 states have (on average 1.8061492313460816) internal successors, (4817), 3495 states have internal predecessors, (4817), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:51:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4867 transitions. [2024-11-07 18:51:06,168 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4867 transitions. Word has length 36 [2024-11-07 18:51:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:06,168 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 4867 transitions. [2024-11-07 18:51:06,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:51:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4867 transitions. [2024-11-07 18:51:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 18:51:06,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:06,172 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] [2024-11-07 18:51:06,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-07 18:51:06,372 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:51:06,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:06,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826600, now seen corresponding path program 1 times [2024-11-07 18:51:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620196304] [2024-11-07 18:51:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:06,375 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:51:06,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:06,378 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:51:06,380 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:51:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:06,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 18:51:06,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:06,638 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:51:06,805 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:51:06,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:06,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620196304] [2024-11-07 18:51:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620196304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805679165] [2024-11-07 18:51:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:06,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:06,807 INFO L87 Difference]: Start difference. First operand 3520 states and 4867 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:51:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:10,565 INFO L93 Difference]: Finished difference Result 4849 states and 6535 transitions. [2024-11-07 18:51:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:10,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-07 18:51:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:10,571 INFO L225 Difference]: With dead ends: 4849 [2024-11-07 18:51:10,571 INFO L226 Difference]: Without dead ends: 4849 [2024-11-07 18:51:10,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:51:10,573 INFO L432 NwaCegarLoop]: 2369 mSDtfsCounter, 1190 mSDsluCounter, 2609 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:10,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 4978 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2660 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-07 18:51:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4849 states. [2024-11-07 18:51:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4849 to 3520. [2024-11-07 18:51:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2667 states have (on average 1.8031496062992125) internal successors, (4809), 3495 states have internal predecessors, (4809), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:51:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4859 transitions. [2024-11-07 18:51:10,610 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4859 transitions. Word has length 36 [2024-11-07 18:51:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:10,611 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 4859 transitions. [2024-11-07 18:51:10,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:51:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4859 transitions. [2024-11-07 18:51:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 18:51:10,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:10,612 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] [2024-11-07 18:51:10,618 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 (16)] Forceful destruction successful, exit code 0 [2024-11-07 18:51:10,816 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:51:10,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988007, now seen corresponding path program 1 times [2024-11-07 18:51:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982075564] [2024-11-07 18:51:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:10,818 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:51:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:10,820 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:51:10,823 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:51:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:11,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:51:11,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:11,055 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:51:11,123 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:51:11,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:11,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982075564] [2024-11-07 18:51:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982075564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:11,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755754109] [2024-11-07 18:51:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:11,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:11,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:11,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:11,124 INFO L87 Difference]: Start difference. First operand 3520 states and 4859 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:51:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:13,959 INFO L93 Difference]: Finished difference Result 4220 states and 5623 transitions. [2024-11-07 18:51:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:13,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-07 18:51:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:13,964 INFO L225 Difference]: With dead ends: 4220 [2024-11-07 18:51:13,964 INFO L226 Difference]: Without dead ends: 4220 [2024-11-07 18:51:13,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:51:13,964 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 1687 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:13,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 4201 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 18:51:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2024-11-07 18:51:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3516. [2024-11-07 18:51:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 2667 states have (on average 1.8001499812523434) internal successors, (4801), 3491 states have internal predecessors, (4801), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:51:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4851 transitions. [2024-11-07 18:51:14,014 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4851 transitions. Word has length 36 [2024-11-07 18:51:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:14,014 INFO L471 AbstractCegarLoop]: Abstraction has 3516 states and 4851 transitions. [2024-11-07 18:51:14,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:51:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4851 transitions. [2024-11-07 18:51:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 18:51:14,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:14,015 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] [2024-11-07 18:51:14,020 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:51:14,215 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:51:14,216 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:14,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988008, now seen corresponding path program 1 times [2024-11-07 18:51:14,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:14,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752373978] [2024-11-07 18:51:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:14,218 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:51:14,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:14,221 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:51:14,223 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:51:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:14,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 18:51:14,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:14,461 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:51:14,618 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:51:14,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:14,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752373978] [2024-11-07 18:51:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752373978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:14,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052682004] [2024-11-07 18:51:14,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:14,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:14,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:14,621 INFO L87 Difference]: Start difference. First operand 3516 states and 4851 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:51:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:18,346 INFO L93 Difference]: Finished difference Result 4841 states and 6519 transitions. [2024-11-07 18:51:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-07 18:51:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:18,363 INFO L225 Difference]: With dead ends: 4841 [2024-11-07 18:51:18,363 INFO L226 Difference]: Without dead ends: 4841 [2024-11-07 18:51:18,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:51:18,363 INFO L432 NwaCegarLoop]: 2365 mSDtfsCounter, 1182 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 4940 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:18,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 4940 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-07 18:51:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2024-11-07 18:51:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 3512. [2024-11-07 18:51:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 2667 states have (on average 1.7971503562054743) internal successors, (4793), 3487 states have internal predecessors, (4793), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:51:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 4843 transitions. [2024-11-07 18:51:18,397 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 4843 transitions. Word has length 36 [2024-11-07 18:51:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:18,397 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 4843 transitions. [2024-11-07 18:51:18,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:51:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 4843 transitions. [2024-11-07 18:51:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 18:51:18,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:18,398 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] [2024-11-07 18:51:18,404 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 (18)] Ended with exit code 0 [2024-11-07 18:51:18,598 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:51:18,598 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:18,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:18,599 INFO L85 PathProgramCache]: Analyzing trace with hash 841114057, now seen corresponding path program 1 times [2024-11-07 18:51:18,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:18,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270394968] [2024-11-07 18:51:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:18,599 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:51:18,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:18,601 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:51:18,602 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:51:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:18,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:51:18,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:18,839 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:51:18,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:18,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:18,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270394968] [2024-11-07 18:51:18,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270394968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:18,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:18,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724194435] [2024-11-07 18:51:18,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:18,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:18,841 INFO L87 Difference]: Start difference. First operand 3512 states and 4843 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:51:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:18,909 INFO L93 Difference]: Finished difference Result 3500 states and 4819 transitions. [2024-11-07 18:51:18,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:51:18,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-07 18:51:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:18,914 INFO L225 Difference]: With dead ends: 3500 [2024-11-07 18:51:18,914 INFO L226 Difference]: Without dead ends: 3500 [2024-11-07 18:51:18,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:51:18,914 INFO L432 NwaCegarLoop]: 2016 mSDtfsCounter, 27 mSDsluCounter, 3995 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6011 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:51:18,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6011 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2024-11-07 18:51:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3500. [2024-11-07 18:51:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2655 states have (on average 1.7962335216572505) internal successors, (4769), 3475 states have internal predecessors, (4769), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 18:51:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4819 transitions. [2024-11-07 18:51:18,952 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4819 transitions. Word has length 41 [2024-11-07 18:51:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:18,953 INFO L471 AbstractCegarLoop]: Abstraction has 3500 states and 4819 transitions. [2024-11-07 18:51:18,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:51:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4819 transitions. [2024-11-07 18:51:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 18:51:18,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:18,954 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] [2024-11-07 18:51:18,959 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:51:19,155 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:51:19,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:19,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash 385316629, now seen corresponding path program 1 times [2024-11-07 18:51:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:19,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956222473] [2024-11-07 18:51:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:19,156 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:51:19,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:19,159 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:51:19,161 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:51:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:19,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:51:19,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:19,574 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:51:19,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:19,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:19,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956222473] [2024-11-07 18:51:19,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956222473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:19,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:19,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388167100] [2024-11-07 18:51:19,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:19,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:51:19,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:19,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:51:19,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:19,577 INFO L87 Difference]: Start difference. First operand 3500 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:51:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:19,757 INFO L93 Difference]: Finished difference Result 5151 states and 6877 transitions. [2024-11-07 18:51:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:51:19,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2024-11-07 18:51:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:19,762 INFO L225 Difference]: With dead ends: 5151 [2024-11-07 18:51:19,762 INFO L226 Difference]: Without dead ends: 5151 [2024-11-07 18:51:19,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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:51:19,763 INFO L432 NwaCegarLoop]: 2101 mSDtfsCounter, 1299 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:19,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 4032 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 18:51:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2024-11-07 18:51:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4554. [2024-11-07 18:51:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 3702 states have (on average 1.7847109670448407) internal successors, (6607), 4519 states have internal predecessors, (6607), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 18:51:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 6677 transitions. [2024-11-07 18:51:19,818 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 6677 transitions. Word has length 49 [2024-11-07 18:51:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:19,819 INFO L471 AbstractCegarLoop]: Abstraction has 4554 states and 6677 transitions. [2024-11-07 18:51:19,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:51:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6677 transitions. [2024-11-07 18:51:19,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 18:51:19,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:19,820 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] [2024-11-07 18:51:19,826 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 (20)] Forceful destruction successful, exit code 0 [2024-11-07 18:51:20,020 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:51:20,021 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:20,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2050666657, now seen corresponding path program 1 times [2024-11-07 18:51:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382583227] [2024-11-07 18:51:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:20,022 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:51:20,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:20,023 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:51:20,024 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:51:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:20,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:51:20,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:20,338 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:51:20,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:20,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382583227] [2024-11-07 18:51:20,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382583227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544400063] [2024-11-07 18:51:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:20,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:20,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:20,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:20,340 INFO L87 Difference]: Start difference. First operand 4554 states and 6677 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:51:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:20,389 INFO L93 Difference]: Finished difference Result 4512 states and 6607 transitions. [2024-11-07 18:51:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:51:20,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2024-11-07 18:51:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:20,395 INFO L225 Difference]: With dead ends: 4512 [2024-11-07 18:51:20,395 INFO L226 Difference]: Without dead ends: 4512 [2024-11-07 18:51:20,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:51:20,396 INFO L432 NwaCegarLoop]: 2012 mSDtfsCounter, 27 mSDsluCounter, 3987 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5999 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:51:20,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5999 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2024-11-07 18:51:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4512. [2024-11-07 18:51:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3660 states have (on average 1.7860655737704918) internal successors, (6537), 4477 states have internal predecessors, (6537), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 18:51:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 6607 transitions. [2024-11-07 18:51:20,431 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 6607 transitions. Word has length 52 [2024-11-07 18:51:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:20,431 INFO L471 AbstractCegarLoop]: Abstraction has 4512 states and 6607 transitions. [2024-11-07 18:51:20,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:51:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 6607 transitions. [2024-11-07 18:51:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 18:51:20,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:20,432 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] [2024-11-07 18:51:20,439 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:51:20,635 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:51:20,635 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:20,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash 705263610, now seen corresponding path program 1 times [2024-11-07 18:51:20,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645382344] [2024-11-07 18:51:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:20,636 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:51:20,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:20,640 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:51:20,641 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:51:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:20,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:51:20,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:20,921 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:51:20,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:20,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645382344] [2024-11-07 18:51:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645382344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:20,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266540941] [2024-11-07 18:51:20,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:20,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:20,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:20,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:20,923 INFO L87 Difference]: Start difference. First operand 4512 states and 6607 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:51:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:20,986 INFO L93 Difference]: Finished difference Result 4494 states and 6577 transitions. [2024-11-07 18:51:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 18:51:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-11-07 18:51:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:20,992 INFO L225 Difference]: With dead ends: 4494 [2024-11-07 18:51:20,992 INFO L226 Difference]: Without dead ends: 4494 [2024-11-07 18:51:20,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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:51:20,993 INFO L432 NwaCegarLoop]: 2008 mSDtfsCounter, 21 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5993 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:51:20,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5993 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2024-11-07 18:51:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 4494. [2024-11-07 18:51:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4494 states, 3642 states have (on average 1.78665568369028) internal successors, (6507), 4459 states have internal predecessors, (6507), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 18:51:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4494 states to 4494 states and 6577 transitions. [2024-11-07 18:51:21,038 INFO L78 Accepts]: Start accepts. Automaton has 4494 states and 6577 transitions. Word has length 55 [2024-11-07 18:51:21,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:21,039 INFO L471 AbstractCegarLoop]: Abstraction has 4494 states and 6577 transitions. [2024-11-07 18:51:21,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:51:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4494 states and 6577 transitions. [2024-11-07 18:51:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 18:51:21,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:21,039 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] [2024-11-07 18:51:21,044 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:51:21,240 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:51:21,240 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:21,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1394668725, now seen corresponding path program 1 times [2024-11-07 18:51:21,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:21,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652198055] [2024-11-07 18:51:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:21,241 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:51:21,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:21,242 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:51:21,244 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:51:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:21,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:51:21,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:21,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:51:21,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:51:21,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-07 18:51:21,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 18:51:21,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-11-07 18:51:21,549 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:51:21,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:21,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652198055] [2024-11-07 18:51:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652198055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:21,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:21,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:21,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461178741] [2024-11-07 18:51:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:21,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:21,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:21,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:21,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:21,552 INFO L87 Difference]: Start difference. First operand 4494 states and 6577 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:22,285 INFO L93 Difference]: Finished difference Result 5952 states and 8592 transitions. [2024-11-07 18:51:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 18:51:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:22,294 INFO L225 Difference]: With dead ends: 5952 [2024-11-07 18:51:22,294 INFO L226 Difference]: Without dead ends: 5952 [2024-11-07 18:51:22,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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:51:22,295 INFO L432 NwaCegarLoop]: 2130 mSDtfsCounter, 1694 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 5455 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:22,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 5455 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 18:51:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2024-11-07 18:51:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4460. [2024-11-07 18:51:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4460 states, 3608 states have (on average 1.793791574279379) internal successors, (6472), 4425 states have internal predecessors, (6472), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 18:51:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4460 states to 4460 states and 6542 transitions. [2024-11-07 18:51:22,346 INFO L78 Accepts]: Start accepts. Automaton has 4460 states and 6542 transitions. Word has length 60 [2024-11-07 18:51:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:22,346 INFO L471 AbstractCegarLoop]: Abstraction has 4460 states and 6542 transitions. [2024-11-07 18:51:22,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 18:51:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4460 states and 6542 transitions. [2024-11-07 18:51:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 18:51:22,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:22,347 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] [2024-11-07 18:51:22,353 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 (23)] Ended with exit code 0 [2024-11-07 18:51:22,547 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:51:22,547 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:22,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1034209811, now seen corresponding path program 1 times [2024-11-07 18:51:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560412055] [2024-11-07 18:51:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:22,549 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:51:22,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:22,550 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:51:22,551 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:51:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:22,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:51:22,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:23,050 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:51:23,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:23,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:23,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560412055] [2024-11-07 18:51:23,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560412055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:23,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:23,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762298178] [2024-11-07 18:51:23,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:23,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 18:51:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:23,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 18:51:23,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 18:51:23,051 INFO L87 Difference]: Start difference. First operand 4460 states and 6542 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:51:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:23,204 INFO L93 Difference]: Finished difference Result 6108 states and 8657 transitions. [2024-11-07 18:51:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 18:51:23,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-07 18:51:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:23,211 INFO L225 Difference]: With dead ends: 6108 [2024-11-07 18:51:23,211 INFO L226 Difference]: Without dead ends: 6108 [2024-11-07 18:51:23,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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:51:23,212 INFO L432 NwaCegarLoop]: 2027 mSDtfsCounter, 1009 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:23,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3988 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:51:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6108 states. [2024-11-07 18:51:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6108 to 5560. [2024-11-07 18:51:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4700 states have (on average 1.7717021276595746) internal successors, (8327), 5514 states have internal predecessors, (8327), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 18:51:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 8419 transitions. [2024-11-07 18:51:23,252 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 8419 transitions. Word has length 60 [2024-11-07 18:51:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:23,252 INFO L471 AbstractCegarLoop]: Abstraction has 5560 states and 8419 transitions. [2024-11-07 18:51:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:51:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 8419 transitions. [2024-11-07 18:51:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 18:51:23,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:23,252 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] [2024-11-07 18:51:23,260 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 (24)] Forceful destruction successful, exit code 0 [2024-11-07 18:51:23,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:51:23,453 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:23,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:23,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1844344716, now seen corresponding path program 1 times [2024-11-07 18:51:23,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166175539] [2024-11-07 18:51:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:23,454 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:51:23,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:23,456 INFO L229 MonitoredProcess]: Starting monitored process 25 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:51:23,457 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 (25)] Waiting until timeout for monitored process [2024-11-07 18:51:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:23,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 18:51:23,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:23,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:51:23,786 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:51:23,786 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 18:51:23,787 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:51:23,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 18:51:23,953 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:51:23,965 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:51:23,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:23,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:23,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166175539] [2024-11-07 18:51:23,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166175539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:23,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:23,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282910205] [2024-11-07 18:51:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:23,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:23,966 INFO L87 Difference]: Start difference. First operand 5560 states and 8419 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:51:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:24,378 INFO L93 Difference]: Finished difference Result 5884 states and 8505 transitions. [2024-11-07 18:51:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-07 18:51:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:24,384 INFO L225 Difference]: With dead ends: 5884 [2024-11-07 18:51:24,384 INFO L226 Difference]: Without dead ends: 5884 [2024-11-07 18:51:24,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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:51:24,384 INFO L432 NwaCegarLoop]: 2228 mSDtfsCounter, 857 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 6353 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:24,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 6353 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 18:51:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2024-11-07 18:51:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 5119. [2024-11-07 18:51:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5119 states, 4259 states have (on average 1.7912655552946701) internal successors, (7629), 5076 states have internal predecessors, (7629), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 18:51:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 7715 transitions. [2024-11-07 18:51:24,420 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 7715 transitions. Word has length 63 [2024-11-07 18:51:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:24,420 INFO L471 AbstractCegarLoop]: Abstraction has 5119 states and 7715 transitions. [2024-11-07 18:51:24,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:51:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 7715 transitions. [2024-11-07 18:51:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 18:51:24,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:24,420 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] [2024-11-07 18:51:24,427 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 (25)] Ended with exit code 0 [2024-11-07 18:51:24,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:51:24,621 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:24,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1265725906, now seen corresponding path program 1 times [2024-11-07 18:51:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:24,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64352883] [2024-11-07 18:51:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:24,622 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:51:24,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:24,624 INFO L229 MonitoredProcess]: Starting monitored process 26 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:51:24,625 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 (26)] Waiting until timeout for monitored process [2024-11-07 18:51:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:24,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 18:51:24,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:24,969 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:51:24,977 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:51:25,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 18:51:25,362 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:51:25,369 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 18:51:25,369 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:51:25,377 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:51:25,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:25,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64352883] [2024-11-07 18:51:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64352883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:25,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:25,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 18:51:25,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937709553] [2024-11-07 18:51:25,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:25,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:25,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:25,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:25,378 INFO L87 Difference]: Start difference. First operand 5119 states and 7715 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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:51:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:27,744 INFO L93 Difference]: Finished difference Result 5035 states and 7472 transitions. [2024-11-07 18:51:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-07 18:51:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:27,749 INFO L225 Difference]: With dead ends: 5035 [2024-11-07 18:51:27,750 INFO L226 Difference]: Without dead ends: 5035 [2024-11-07 18:51:27,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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:51:27,750 INFO L432 NwaCegarLoop]: 864 mSDtfsCounter, 1606 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:27,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1616 Valid, 1082 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 18:51:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5035 states. [2024-11-07 18:51:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5035 to 4895. [2024-11-07 18:51:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4895 states, 4119 states have (on average 1.7310026705511046) internal successors, (7130), 4852 states have internal predecessors, (7130), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 18:51:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 7216 transitions. [2024-11-07 18:51:27,787 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 7216 transitions. Word has length 63 [2024-11-07 18:51:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:27,787 INFO L471 AbstractCegarLoop]: Abstraction has 4895 states and 7216 transitions. [2024-11-07 18:51:27,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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:51:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 7216 transitions. [2024-11-07 18:51:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 18:51:27,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:27,788 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] [2024-11-07 18:51:27,797 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 (26)] Ended with exit code 0 [2024-11-07 18:51:27,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:51:27,989 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:27,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:27,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1551615488, now seen corresponding path program 1 times [2024-11-07 18:51:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:27,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624642654] [2024-11-07 18:51:27,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:27,990 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:51:27,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:27,991 INFO L229 MonitoredProcess]: Starting monitored process 27 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:51:27,992 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 (27)] Waiting until timeout for monitored process [2024-11-07 18:51:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:28,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 18:51:28,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:28,299 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:51:28,317 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:51:28,342 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:51:28,351 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:51:28,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:28,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624642654] [2024-11-07 18:51:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624642654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027551600] [2024-11-07 18:51:28,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:51:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:51:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:51:28,352 INFO L87 Difference]: Start difference. First operand 4895 states and 7216 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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:51:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:31,110 INFO L93 Difference]: Finished difference Result 4894 states and 7213 transitions. [2024-11-07 18:51:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:51:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-07 18:51:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:31,114 INFO L225 Difference]: With dead ends: 4894 [2024-11-07 18:51:31,114 INFO L226 Difference]: Without dead ends: 4894 [2024-11-07 18:51:31,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 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:51:31,114 INFO L432 NwaCegarLoop]: 1935 mSDtfsCounter, 2 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5192 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:31,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5192 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 18:51:31,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2024-11-07 18:51:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4894. [2024-11-07 18:51:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4894 states, 4119 states have (on average 1.7302743384316581) internal successors, (7127), 4851 states have internal predecessors, (7127), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 18:51:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 7213 transitions. [2024-11-07 18:51:31,147 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 7213 transitions. Word has length 68 [2024-11-07 18:51:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 4894 states and 7213 transitions. [2024-11-07 18:51:31,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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:51:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 7213 transitions. [2024-11-07 18:51:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 18:51:31,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:31,147 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] [2024-11-07 18:51:31,156 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 (27)] Ended with exit code 0 [2024-11-07 18:51:31,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:51:31,348 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:31,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1551615487, now seen corresponding path program 1 times [2024-11-07 18:51:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769536466] [2024-11-07 18:51:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:31,349 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:51:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:31,351 INFO L229 MonitoredProcess]: Starting monitored process 28 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:51:31,352 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 (28)] Waiting until timeout for monitored process [2024-11-07 18:51:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:31,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 18:51:31,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:31,631 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:51:31,641 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:51:31,644 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:51:31,676 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:51:31,687 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:51:31,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:31,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:31,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769536466] [2024-11-07 18:51:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769536466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:31,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:31,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375708478] [2024-11-07 18:51:31,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:31,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 18:51:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 18:51:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 18:51:31,688 INFO L87 Difference]: Start difference. First operand 4894 states and 7213 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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:51:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:35,161 INFO L93 Difference]: Finished difference Result 4893 states and 7210 transitions. [2024-11-07 18:51:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 18:51:35,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-07 18:51:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:35,166 INFO L225 Difference]: With dead ends: 4893 [2024-11-07 18:51:35,166 INFO L226 Difference]: Without dead ends: 4893 [2024-11-07 18:51:35,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 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:51:35,166 INFO L432 NwaCegarLoop]: 1935 mSDtfsCounter, 1 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5158 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:35,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5158 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 18:51:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2024-11-07 18:51:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4893. [2024-11-07 18:51:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4893 states, 4116 states have (on average 1.7308066083576288) internal successors, (7124), 4850 states have internal predecessors, (7124), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 18:51:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4893 states to 4893 states and 7210 transitions. [2024-11-07 18:51:35,204 INFO L78 Accepts]: Start accepts. Automaton has 4893 states and 7210 transitions. Word has length 68 [2024-11-07 18:51:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:35,204 INFO L471 AbstractCegarLoop]: Abstraction has 4893 states and 7210 transitions. [2024-11-07 18:51:35,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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:51:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4893 states and 7210 transitions. [2024-11-07 18:51:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 18:51:35,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:35,205 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, 1] [2024-11-07 18:51:35,213 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 (28)] Ended with exit code 0 [2024-11-07 18:51:35,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:51:35,406 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:35,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1890602087, now seen corresponding path program 1 times [2024-11-07 18:51:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218142837] [2024-11-07 18:51:35,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:35,407 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:51:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:35,409 INFO L229 MonitoredProcess]: Starting monitored process 29 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:51:35,410 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 (29)] Waiting until timeout for monitored process [2024-11-07 18:51:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:35,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 18:51:35,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:35,729 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:51:35,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 18:51:35,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218142837] [2024-11-07 18:51:35,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218142837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 18:51:35,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 18:51:35,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 18:51:35,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107060268] [2024-11-07 18:51:35,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 18:51:35,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 18:51:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:35,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 18:51:35,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 18:51:35,731 INFO L87 Difference]: Start difference. First operand 4893 states and 7210 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:51:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:35,781 INFO L93 Difference]: Finished difference Result 4896 states and 7218 transitions. [2024-11-07 18:51:35,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 18:51:35,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 76 [2024-11-07 18:51:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:35,790 INFO L225 Difference]: With dead ends: 4896 [2024-11-07 18:51:35,790 INFO L226 Difference]: Without dead ends: 4896 [2024-11-07 18:51:35,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 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:51:35,790 INFO L432 NwaCegarLoop]: 1934 mSDtfsCounter, 0 mSDsluCounter, 3860 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:35,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5794 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 18:51:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2024-11-07 18:51:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 4896. [2024-11-07 18:51:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 4118 states have (on average 1.73069451189898) internal successors, (7127), 4853 states have internal predecessors, (7127), 43 states have call successors, (43), 3 states have call predecessors, (43), 4 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-07 18:51:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 7218 transitions. [2024-11-07 18:51:35,847 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 7218 transitions. Word has length 76 [2024-11-07 18:51:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:35,847 INFO L471 AbstractCegarLoop]: Abstraction has 4896 states and 7218 transitions. [2024-11-07 18:51:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:51:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 7218 transitions. [2024-11-07 18:51:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 18:51:35,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:35,848 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, 1, 1] [2024-11-07 18:51:35,857 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 (29)] Ended with exit code 0 [2024-11-07 18:51:36,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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:51:36,049 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1898947547, now seen corresponding path program 1 times [2024-11-07 18:51:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204897415] [2024-11-07 18:51:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 18:51:36,050 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:51:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:36,052 INFO L229 MonitoredProcess]: Starting monitored process 30 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:51:36,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-07 18:51:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 18:51:36,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 18:51:36,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:36,368 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:51:36,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:51:36,409 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:51:36,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:36,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204897415] [2024-11-07 18:51:36,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204897415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:51:36,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:51:36,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 18:51:36,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685369646] [2024-11-07 18:51:36,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:51:36,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 18:51:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 18:51:36,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 18:51:36,410 INFO L87 Difference]: Start difference. First operand 4896 states and 7218 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:51:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:36,572 INFO L93 Difference]: Finished difference Result 4908 states and 7239 transitions. [2024-11-07 18:51:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 18:51:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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 77 [2024-11-07 18:51:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:36,581 INFO L225 Difference]: With dead ends: 4908 [2024-11-07 18:51:36,581 INFO L226 Difference]: Without dead ends: 4908 [2024-11-07 18:51:36,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-07 18:51:36,581 INFO L432 NwaCegarLoop]: 1933 mSDtfsCounter, 5 mSDsluCounter, 11561 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13494 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:36,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13494 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 18:51:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2024-11-07 18:51:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4906. [2024-11-07 18:51:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4127 states have (on average 1.7305548824812211) internal successors, (7142), 4862 states have internal predecessors, (7142), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-07 18:51:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 7233 transitions. [2024-11-07 18:51:36,654 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 7233 transitions. Word has length 77 [2024-11-07 18:51:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:36,654 INFO L471 AbstractCegarLoop]: Abstraction has 4906 states and 7233 transitions. [2024-11-07 18:51:36,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:51:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 7233 transitions. [2024-11-07 18:51:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 18:51:36,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:36,655 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, 1, 1] [2024-11-07 18:51:36,664 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 (30)] Ended with exit code 0 [2024-11-07 18:51:36,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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:51:36,856 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:36,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1099204967, now seen corresponding path program 2 times [2024-11-07 18:51:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821355174] [2024-11-07 18:51:36,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 18:51:36,857 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:51:36,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:36,859 INFO L229 MonitoredProcess]: Starting monitored process 31 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:51:36,862 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 (31)] Waiting until timeout for monitored process [2024-11-07 18:51:37,337 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 18:51:37,337 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:51:37,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 18:51:37,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:37,408 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:51:37,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:51:37,559 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:51:37,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821355174] [2024-11-07 18:51:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821355174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:51:37,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:51:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 18:51:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976299207] [2024-11-07 18:51:37,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:51:37,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 18:51:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 18:51:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 18:51:37,561 INFO L87 Difference]: Start difference. First operand 4906 states and 7233 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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:51:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 18:51:37,922 INFO L93 Difference]: Finished difference Result 4921 states and 7259 transitions. [2024-11-07 18:51:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 18:51:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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 80 [2024-11-07 18:51:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 18:51:37,933 INFO L225 Difference]: With dead ends: 4921 [2024-11-07 18:51:37,933 INFO L226 Difference]: Without dead ends: 4917 [2024-11-07 18:51:37,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-07 18:51:37,934 INFO L432 NwaCegarLoop]: 1933 mSDtfsCounter, 9 mSDsluCounter, 15426 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17359 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 18:51:37,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17359 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 18:51:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2024-11-07 18:51:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4915. [2024-11-07 18:51:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4915 states, 4136 states have (on average 1.7296905222437138) internal successors, (7154), 4871 states have internal predecessors, (7154), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-07 18:51:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 7245 transitions. [2024-11-07 18:51:37,999 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 7245 transitions. Word has length 80 [2024-11-07 18:51:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 18:51:37,999 INFO L471 AbstractCegarLoop]: Abstraction has 4915 states and 7245 transitions. [2024-11-07 18:51:37,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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:51:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 7245 transitions. [2024-11-07 18:51:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 18:51:38,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 18:51:38,000 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, 1, 1] [2024-11-07 18:51:38,010 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 (31)] Ended with exit code 0 [2024-11-07 18:51:38,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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:51:38,201 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-11-07 18:51:38,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 18:51:38,201 INFO L85 PathProgramCache]: Analyzing trace with hash 726054119, now seen corresponding path program 3 times [2024-11-07 18:51:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 18:51:38,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177130759] [2024-11-07 18:51:38,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 18:51:38,202 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:51:38,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 18:51:38,204 INFO L229 MonitoredProcess]: Starting monitored process 32 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:51:38,205 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 (32)] Waiting until timeout for monitored process [2024-11-07 18:51:38,830 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-07 18:51:38,830 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 18:51:38,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 18:51:38,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 18:51:38,987 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:51:38,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 18:51:39,385 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:51:39,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 18:51:39,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177130759] [2024-11-07 18:51:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177130759] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 18:51:39,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 18:51:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 18:51:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943368254] [2024-11-07 18:51:39,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 18:51:39,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 18:51:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 18:51:39,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 18:51:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-07 18:51:39,388 INFO L87 Difference]: Start difference. First operand 4915 states and 7245 transitions. Second operand has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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)