./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-memcleanup) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da'] 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_OAT_test6-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:06:45,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:06:45,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-07 16:06:45,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:06:45,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:06:45,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:06:45,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:06:45,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:06:45,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:06:45,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:06:45,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:06:45,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:06:45,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:06:45,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:06:45,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:06:45,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:06:45,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:06:45,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:06:45,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:06:45,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:06:45,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:06:45,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:06:45,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:06:45,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:06:45,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:06:45,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:06:45,161 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da [2024-11-07 16:06:45,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:06:45,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:06:45,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:06:45,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:06:45,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:06:45,436 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_OAT_test6-2.i [2024-11-07 16:06:46,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:06:47,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:06:47,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2024-11-07 16:06:47,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8c94bdd6/27b6d32b9e984ea7ac7d18c85b4b03b5/FLAGdd243e712 [2024-11-07 16:06:47,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8c94bdd6/27b6d32b9e984ea7ac7d18c85b4b03b5 [2024-11-07 16:06:47,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:06:47,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:06:47,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:06:47,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:06:47,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:06:47,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:06:47" (1/1) ... [2024-11-07 16:06:47,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec6b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:47, skipping insertion in model container [2024-11-07 16:06:47,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:06:47" (1/1) ... [2024-11-07 16:06:47,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:06:47,496 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,526 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,529 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,535 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,572 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,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 16:06:47,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 16:06:47,577 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,579 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,579 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,580 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,583 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,584 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,586 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,589 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,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 16:06:47,591 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,594 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:47,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:06:47,616 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-07 16:06:47,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1f4337f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:47, skipping insertion in model container [2024-11-07 16:06:47,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:06:47,618 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 16:06:47,620 INFO L158 Benchmark]: Toolchain (without parser) took 570.85ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 52.5MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 16:06:47,622 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory was 48.3MB in the beginning and 48.2MB in the end (delta: 82.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:06:47,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.41ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 52.5MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 16:06:47,623 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.26ms. Allocated memory is still 83.9MB. Free memory was 48.3MB in the beginning and 48.2MB in the end (delta: 82.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.41ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 52.5MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: 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_OAT_test6-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:06:49,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:06:49,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-07 16:06:49,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:06:49,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:06:49,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:06:49,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:06:49,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:06:49,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:06:49,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:06:49,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:06:49,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:06:49,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:06:49,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:06:49,721 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:06:49,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:06:49,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:06:49,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:06:49,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:06:49,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:06:49,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:06:49,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:06:49,722 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:06:49,722 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:06:49,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:06:49,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:06:49,723 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:06:49,723 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:06:49,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:06:49,723 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:06:49,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:06:49,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:06:49,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:06:49,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:06:49,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:06:49,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:06:49,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:06:49,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:06:49,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:06:49,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:06:49,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:06:49,725 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:06:49,725 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:06:49,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:06:49,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:06:49,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:06:49,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:06:49,725 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da [2024-11-07 16:06:50,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:06:50,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:06:50,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:06:50,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:06:50,041 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:06:50,042 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_OAT_test6-2.i [2024-11-07 16:06:51,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:06:51,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:06:51,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2024-11-07 16:06:51,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b46db347e/a619b0b1be204c84a64ecd7992377846/FLAG201699008 [2024-11-07 16:06:51,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b46db347e/a619b0b1be204c84a64ecd7992377846 [2024-11-07 16:06:51,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:06:51,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:06:51,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:06:51,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:06:51,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:06:51,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:06:51" (1/1) ... [2024-11-07 16:06:51,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78bb9a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:51, skipping insertion in model container [2024-11-07 16:06:51,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:06:51" (1/1) ... [2024-11-07 16:06:51,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:06:52,280 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,315 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,318 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,323 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,329 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,363 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,363 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,366 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,370 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,372 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,373 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,377 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,378 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,380 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,381 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,385 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,385 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,391 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:06:52,409 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 16:06:52,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:06:52,467 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,482 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,484 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,485 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,489 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,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 16:06:52,512 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,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 16:06:52,514 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,515 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,517 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,519 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,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 16:06:52,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,523 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,523 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,525 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:06:52,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:06:52,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:06:52,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:06:52,703 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:06:52,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52 WrapperNode [2024-11-07 16:06:52,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:06:52,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:06:52,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:06:52,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:06:52,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:52,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:52,799 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1233 [2024-11-07 16:06:52,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:06:52,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:06:52,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:06:52,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:06:52,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:52,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:52,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:52,933 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 34, 12, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 62 writes are split as follows [0, 4, 1, 57]. [2024-11-07 16:06:52,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:52,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:52,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:52,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:53,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:53,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:53,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:06:53,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:06:53,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:06:53,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:06:53,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (1/1) ... [2024-11-07 16:06:53,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:06:53,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:06:53,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 16:06:53,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 16:06:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 16:06:53,090 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 16:06:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 16:06:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 16:06:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 16:06:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 16:06:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 16:06:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 16:06:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 16:06:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 16:06:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:06:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:06:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:06:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:06:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 16:06:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:06:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 16:06:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 16:06:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 16:06:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 16:06:53,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 16:06:53,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 16:06:53,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 16:06:53,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 16:06:53,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 16:06:53,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 16:06:53,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-07 16:06:53,095 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 16:06:53,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-07 16:06:53,095 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-07 16:06:53,095 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-07 16:06:53,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:06:53,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:06:53,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:06:53,335 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:06:59,932 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-11-07 16:06:59,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:06:59,949 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:06:59,951 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-07 16:06:59,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:06:59 BoogieIcfgContainer [2024-11-07 16:06:59,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:06:59,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:06:59,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:06:59,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:06:59,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:06:51" (1/3) ... [2024-11-07 16:06:59,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fff135d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:06:59, skipping insertion in model container [2024-11-07 16:06:59,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:06:52" (2/3) ... [2024-11-07 16:06:59,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fff135d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:06:59, skipping insertion in model container [2024-11-07 16:06:59,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:06:59" (3/3) ... [2024-11-07 16:06:59,961 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-2.i [2024-11-07 16:06:59,975 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:06:59,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 16:07:00,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:07:00,019 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;@ef93686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:07:00,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 16:07:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 269 states, 242 states have (on average 1.6074380165289257) internal successors, (389), 247 states have internal predecessors, (389), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 16:07:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:07:00,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:00,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:00,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1647492033, now seen corresponding path program 1 times [2024-11-07 16:07:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:00,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296490097] [2024-11-07 16:07:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:00,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:00,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:00,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 16:07:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:00,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 16:07:00,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:00,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:00,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:00,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296490097] [2024-11-07 16:07:00,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296490097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:00,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:00,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:07:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985521803] [2024-11-07 16:07:00,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:00,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:07:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:00,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:07:00,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:07:00,357 INFO L87 Difference]: Start difference. First operand has 269 states, 242 states have (on average 1.6074380165289257) internal successors, (389), 247 states have internal predecessors, (389), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:07:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:00,399 INFO L93 Difference]: Finished difference Result 264 states and 342 transitions. [2024-11-07 16:07:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:07:00,401 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-07 16:07:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:00,411 INFO L225 Difference]: With dead ends: 264 [2024-11-07 16:07:00,411 INFO L226 Difference]: Without dead ends: 262 [2024-11-07 16:07:00,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:07:00,417 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:00,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:07:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-07 16:07:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-11-07 16:07:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2911392405063291) internal successors, (306), 242 states have internal predecessors, (306), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 16:07:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2024-11-07 16:07:00,466 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 10 [2024-11-07 16:07:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:00,467 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2024-11-07 16:07:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:07:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2024-11-07 16:07:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:07:00,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:00,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:00,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 16:07:00,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:00,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:00,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash -617339998, now seen corresponding path program 1 times [2024-11-07 16:07:00,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:00,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773117593] [2024-11-07 16:07:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:00,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:00,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:00,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 16:07:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:00,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:07:00,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:01,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:01,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:01,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773117593] [2024-11-07 16:07:01,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773117593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:01,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:01,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:07:01,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533418012] [2024-11-07 16:07:01,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:01,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:07:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:01,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:07:01,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:07:01,029 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:07:04,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:07:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:06,055 INFO L93 Difference]: Finished difference Result 418 states and 545 transitions. [2024-11-07 16:07:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:07:06,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-07 16:07:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:06,059 INFO L225 Difference]: With dead ends: 418 [2024-11-07 16:07:06,059 INFO L226 Difference]: Without dead ends: 418 [2024-11-07 16:07:06,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:07:06,060 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 186 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:06,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 971 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-07 16:07:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-07 16:07:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 381. [2024-11-07 16:07:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 353 states have (on average 1.2946175637393769) internal successors, (457), 358 states have internal predecessors, (457), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 16:07:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2024-11-07 16:07:06,104 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 12 [2024-11-07 16:07:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:06,104 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2024-11-07 16:07:06,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:07:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2024-11-07 16:07:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:07:06,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:06,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:06,110 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 16:07:06,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:06,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:06,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash -919823020, now seen corresponding path program 1 times [2024-11-07 16:07:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:06,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062202818] [2024-11-07 16:07:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:06,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:06,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:06,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:06,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 16:07:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:06,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:07:06,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:06,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:07:06,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:07:06,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:07:06,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-07 16:07:06,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:07:06,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-07 16:07:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:06,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:06,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062202818] [2024-11-07 16:07:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062202818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:07:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676366716] [2024-11-07 16:07:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:06,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:07:06,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:06,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:07:06,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:07:06,642 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 16:07:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:07,088 INFO L93 Difference]: Finished difference Result 596 states and 785 transitions. [2024-11-07 16:07:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:07:07,089 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), 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 15 [2024-11-07 16:07:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:07,092 INFO L225 Difference]: With dead ends: 596 [2024-11-07 16:07:07,092 INFO L226 Difference]: Without dead ends: 596 [2024-11-07 16:07:07,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:07:07,094 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 274 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:07,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1050 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:07:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-07 16:07:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 380. [2024-11-07 16:07:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 352 states have (on average 1.2926136363636365) internal successors, (455), 357 states have internal predecessors, (455), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 16:07:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 495 transitions. [2024-11-07 16:07:07,118 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 495 transitions. Word has length 15 [2024-11-07 16:07:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:07,118 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 495 transitions. [2024-11-07 16:07:07,118 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), 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 16:07:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 495 transitions. [2024-11-07 16:07:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 16:07:07,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:07,119 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] [2024-11-07 16:07:07,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 16:07:07,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:07,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:07,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2120572721, now seen corresponding path program 1 times [2024-11-07 16:07:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:07,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066170333] [2024-11-07 16:07:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:07,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:07,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:07,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:07,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 16:07:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:07,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:07:07,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:07,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:07,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:07,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066170333] [2024-11-07 16:07:07,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066170333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:07:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940647412] [2024-11-07 16:07:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:07,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:07:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:07:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:07:07,699 INFO L87 Difference]: Start difference. First operand 380 states and 495 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:07:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:07,795 INFO L93 Difference]: Finished difference Result 386 states and 485 transitions. [2024-11-07 16:07:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:07:07,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-07 16:07:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:07,798 INFO L225 Difference]: With dead ends: 386 [2024-11-07 16:07:07,798 INFO L226 Difference]: Without dead ends: 386 [2024-11-07 16:07:07,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:07:07,799 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 30 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:07,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 911 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:07:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-07 16:07:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-11-07 16:07:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 363 states have internal predecessors, (445), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 16:07:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 485 transitions. [2024-11-07 16:07:07,813 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 485 transitions. Word has length 50 [2024-11-07 16:07:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 485 transitions. [2024-11-07 16:07:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:07:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 485 transitions. [2024-11-07 16:07:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 16:07:07,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:07,815 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] [2024-11-07 16:07:07,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:07:08,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:08,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:08,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1719810523, now seen corresponding path program 1 times [2024-11-07 16:07:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462204499] [2024-11-07 16:07:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:08,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:08,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:08,019 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:08,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 16:07:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:08,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:07:08,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:08,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:08,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:08,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462204499] [2024-11-07 16:07:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462204499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:08,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:08,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:07:08,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315604896] [2024-11-07 16:07:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:08,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:07:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:07:08,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:07:08,376 INFO L87 Difference]: Start difference. First operand 386 states and 485 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:07:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:08,492 INFO L93 Difference]: Finished difference Result 396 states and 495 transitions. [2024-11-07 16:07:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:07:08,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-07 16:07:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:08,495 INFO L225 Difference]: With dead ends: 396 [2024-11-07 16:07:08,496 INFO L226 Difference]: Without dead ends: 396 [2024-11-07 16:07:08,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:07:08,497 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 9 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:08,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1611 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:07:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-07 16:07:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-07 16:07:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 371 states have internal predecessors, (453), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 16:07:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 495 transitions. [2024-11-07 16:07:08,512 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 495 transitions. Word has length 50 [2024-11-07 16:07:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:08,513 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 495 transitions. [2024-11-07 16:07:08,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:07:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 495 transitions. [2024-11-07 16:07:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 16:07:08,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:08,516 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:08,524 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 16:07:08,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:08,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:08,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2051735363, now seen corresponding path program 1 times [2024-11-07 16:07:08,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:08,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666828396] [2024-11-07 16:07:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:08,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:08,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:08,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:08,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 16:07:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:09,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:07:09,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:09,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:09,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:09,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666828396] [2024-11-07 16:07:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666828396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:09,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:07:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323800111] [2024-11-07 16:07:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:07:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:09,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:07:09,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:07:09,296 INFO L87 Difference]: Start difference. First operand 396 states and 495 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:07:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:09,543 INFO L93 Difference]: Finished difference Result 404 states and 505 transitions. [2024-11-07 16:07:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:07:09,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-07 16:07:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:09,548 INFO L225 Difference]: With dead ends: 404 [2024-11-07 16:07:09,550 INFO L226 Difference]: Without dead ends: 404 [2024-11-07 16:07:09,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:07:09,551 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 20 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:09,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1178 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:07:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-07 16:07:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 400. [2024-11-07 16:07:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 367 states have (on average 1.2397820163487738) internal successors, (455), 374 states have internal predecessors, (455), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-07 16:07:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 500 transitions. [2024-11-07 16:07:09,568 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 500 transitions. Word has length 65 [2024-11-07 16:07:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:09,568 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 500 transitions. [2024-11-07 16:07:09,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:07:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 500 transitions. [2024-11-07 16:07:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 16:07:09,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:09,571 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:09,583 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 (7)] Forceful destruction successful, exit code 0 [2024-11-07 16:07:09,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:09,772 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:09,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2090919877, now seen corresponding path program 1 times [2024-11-07 16:07:09,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:09,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290010885] [2024-11-07 16:07:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:09,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:09,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:09,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:09,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 16:07:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:10,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:07:10,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:10,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:10,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290010885] [2024-11-07 16:07:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290010885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:07:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841797654] [2024-11-07 16:07:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:07:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:10,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:07:10,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:07:10,202 INFO L87 Difference]: Start difference. First operand 400 states and 500 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:07:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:10,248 INFO L93 Difference]: Finished difference Result 404 states and 505 transitions. [2024-11-07 16:07:10,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:07:10,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-11-07 16:07:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:10,251 INFO L225 Difference]: With dead ends: 404 [2024-11-07 16:07:10,251 INFO L226 Difference]: Without dead ends: 404 [2024-11-07 16:07:10,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:07:10,252 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 0 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:10,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 970 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:07:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-07 16:07:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-07 16:07:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 370 states have (on average 1.2405405405405405) internal successors, (459), 378 states have internal predecessors, (459), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-07 16:07:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 505 transitions. [2024-11-07 16:07:10,263 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 505 transitions. Word has length 70 [2024-11-07 16:07:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:10,263 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 505 transitions. [2024-11-07 16:07:10,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:07:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 505 transitions. [2024-11-07 16:07:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 16:07:10,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:10,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:10,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 16:07:10,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:10,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:10,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash -731053154, now seen corresponding path program 1 times [2024-11-07 16:07:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850449979] [2024-11-07 16:07:10,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:10,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:10,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:10,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:10,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 16:07:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:10,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:07:10,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:10,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:07:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:07:11,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850449979] [2024-11-07 16:07:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850449979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:07:11,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:07:11,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:07:11,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557378311] [2024-11-07 16:07:11,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:07:11,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:07:11,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:07:11,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:07:11,091 INFO L87 Difference]: Start difference. First operand 404 states and 505 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 16:07:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:11,259 INFO L93 Difference]: Finished difference Result 417 states and 523 transitions. [2024-11-07 16:07:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:07:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2024-11-07 16:07:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:11,262 INFO L225 Difference]: With dead ends: 417 [2024-11-07 16:07:11,262 INFO L226 Difference]: Without dead ends: 417 [2024-11-07 16:07:11,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:07:11,263 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 5 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:11,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1289 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:07:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-07 16:07:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-11-07 16:07:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 379 states have (on average 1.2506596306068603) internal successors, (474), 387 states have internal predecessors, (474), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-07 16:07:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 520 transitions. [2024-11-07 16:07:11,273 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 520 transitions. Word has length 71 [2024-11-07 16:07:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:11,273 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 520 transitions. [2024-11-07 16:07:11,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 16:07:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 520 transitions. [2024-11-07 16:07:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 16:07:11,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:11,275 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:11,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 16:07:11,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:11,475 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:11,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 481662469, now seen corresponding path program 2 times [2024-11-07 16:07:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159052048] [2024-11-07 16:07:11,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:07:11,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:11,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:11,478 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:11,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 16:07:12,069 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:07:12,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:07:12,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:07:12,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:07:12,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:07:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:07:12,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159052048] [2024-11-07 16:07:12,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159052048] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:07:12,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:07:12,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-07 16:07:12,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077868877] [2024-11-07 16:07:12,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:07:12,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:07:12,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:12,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:07:12,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:07:12,532 INFO L87 Difference]: Start difference. First operand 414 states and 520 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:07:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:14,143 INFO L93 Difference]: Finished difference Result 3135 states and 4016 transitions. [2024-11-07 16:07:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 16:07:14,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2024-11-07 16:07:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:14,162 INFO L225 Difference]: With dead ends: 3135 [2024-11-07 16:07:14,162 INFO L226 Difference]: Without dead ends: 3135 [2024-11-07 16:07:14,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-11-07 16:07:14,164 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 3339 mSDsluCounter, 5321 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3365 SdHoareTripleChecker+Valid, 6223 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:14,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3365 Valid, 6223 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 16:07:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2024-11-07 16:07:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2156. [2024-11-07 16:07:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2018 states have (on average 1.265609514370664) internal successors, (2554), 2039 states have internal predecessors, (2554), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-07 16:07:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2754 transitions. [2024-11-07 16:07:14,242 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2754 transitions. Word has length 74 [2024-11-07 16:07:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:14,243 INFO L471 AbstractCegarLoop]: Abstraction has 2156 states and 2754 transitions. [2024-11-07 16:07:14,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:07:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2754 transitions. [2024-11-07 16:07:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 16:07:14,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:14,244 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:14,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 16:07:14,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:14,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:14,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash 91174169, now seen corresponding path program 1 times [2024-11-07 16:07:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:14,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300344394] [2024-11-07 16:07:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:14,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:14,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:14,448 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:14,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 16:07:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:15,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:07:15,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:07:15,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:07:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:07:15,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300344394] [2024-11-07 16:07:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300344394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:07:15,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:07:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 16:07:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864694722] [2024-11-07 16:07:15,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:07:15,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:07:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:07:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:07:15,331 INFO L87 Difference]: Start difference. First operand 2156 states and 2754 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 16:07:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:16,096 INFO L93 Difference]: Finished difference Result 2246 states and 2879 transitions. [2024-11-07 16:07:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:07:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2024-11-07 16:07:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:16,106 INFO L225 Difference]: With dead ends: 2246 [2024-11-07 16:07:16,107 INFO L226 Difference]: Without dead ends: 2216 [2024-11-07 16:07:16,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:07:16,108 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 8 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:16,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1933 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:07:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-11-07 16:07:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2201. [2024-11-07 16:07:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2201 states, 2063 states have (on average 1.2670867668444012) internal successors, (2614), 2084 states have internal predecessors, (2614), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-07 16:07:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 2814 transitions. [2024-11-07 16:07:16,158 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 2814 transitions. Word has length 110 [2024-11-07 16:07:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:16,158 INFO L471 AbstractCegarLoop]: Abstraction has 2201 states and 2814 transitions. [2024-11-07 16:07:16,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 16:07:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2814 transitions. [2024-11-07 16:07:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 16:07:16,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:16,159 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:16,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-07 16:07:16,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:16,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:16,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1756987024, now seen corresponding path program 2 times [2024-11-07 16:07:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68817797] [2024-11-07 16:07:16,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:07:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:16,365 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:16,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 16:07:16,732 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:07:16,732 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:07:16,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:07:16,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:16,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:07:16,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:07:16,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:07:16,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-07 16:07:16,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:07:16,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-07 16:07:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-07 16:07:16,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:16,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:16,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68817797] [2024-11-07 16:07:16,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68817797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:16,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:16,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:07:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677206931] [2024-11-07 16:07:16,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:16,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:07:16,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:16,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:07:16,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:07:16,833 INFO L87 Difference]: Start difference. First operand 2201 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 16:07:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:17,196 INFO L93 Difference]: Finished difference Result 2971 states and 3834 transitions. [2024-11-07 16:07:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:07:17,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-11-07 16:07:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:17,207 INFO L225 Difference]: With dead ends: 2971 [2024-11-07 16:07:17,207 INFO L226 Difference]: Without dead ends: 2971 [2024-11-07 16:07:17,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:07:17,208 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 215 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:17,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 913 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:07:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2024-11-07 16:07:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2213. [2024-11-07 16:07:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2075 states have (on average 1.2655421686746988) internal successors, (2626), 2096 states have internal predecessors, (2626), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-07 16:07:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2826 transitions. [2024-11-07 16:07:17,262 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2826 transitions. Word has length 119 [2024-11-07 16:07:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:17,262 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 2826 transitions. [2024-11-07 16:07:17,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 16:07:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2826 transitions. [2024-11-07 16:07:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 16:07:17,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:17,264 INFO L215 NwaCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:17,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 16:07:17,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:17,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:17,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1356606875, now seen corresponding path program 1 times [2024-11-07 16:07:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:17,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301283997] [2024-11-07 16:07:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:07:17,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:17,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:17,467 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:17,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 16:07:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:07:18,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 16:07:18,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-07 16:07:18,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:07:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-07 16:07:19,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301283997] [2024-11-07 16:07:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301283997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:07:19,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:07:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 16:07:19,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562879057] [2024-11-07 16:07:19,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:07:19,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 16:07:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:19,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 16:07:19,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:07:19,019 INFO L87 Difference]: Start difference. First operand 2213 states and 2826 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 16:07:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:21,646 INFO L93 Difference]: Finished difference Result 2348 states and 3041 transitions. [2024-11-07 16:07:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 16:07:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-07 16:07:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:21,654 INFO L225 Difference]: With dead ends: 2348 [2024-11-07 16:07:21,654 INFO L226 Difference]: Without dead ends: 2318 [2024-11-07 16:07:21,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 16:07:21,656 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 14 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4497 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:21,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4497 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 16:07:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-07 16:07:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2303. [2024-11-07 16:07:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2165 states have (on average 1.2683602771362588) internal successors, (2746), 2186 states have internal predecessors, (2746), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-07 16:07:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2946 transitions. [2024-11-07 16:07:21,697 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2946 transitions. Word has length 126 [2024-11-07 16:07:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:21,697 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 2946 transitions. [2024-11-07 16:07:21,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 16:07:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2946 transitions. [2024-11-07 16:07:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 16:07:21,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:21,699 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:21,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-07 16:07:21,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:21,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1020044859, now seen corresponding path program 2 times [2024-11-07 16:07:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555573466] [2024-11-07 16:07:21,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:07:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:21,904 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:21,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 16:07:23,055 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:07:23,055 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:07:23,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:07:23,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 317 proven. 253 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-07 16:07:23,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:07:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-07 16:07:25,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555573466] [2024-11-07 16:07:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555573466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:07:25,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:07:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-07 16:07:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053964973] [2024-11-07 16:07:25,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:07:25,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 16:07:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:25,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 16:07:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 16:07:25,675 INFO L87 Difference]: Start difference. First operand 2303 states and 2946 transitions. Second operand has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 16:07:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:07:37,273 INFO L93 Difference]: Finished difference Result 2518 states and 3321 transitions. [2024-11-07 16:07:37,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-07 16:07:37,276 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2024-11-07 16:07:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:07:37,283 INFO L225 Difference]: With dead ends: 2518 [2024-11-07 16:07:37,283 INFO L226 Difference]: Without dead ends: 2488 [2024-11-07 16:07:37,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-07 16:07:37,286 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 25 mSDsluCounter, 7705 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8030 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:07:37,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8030 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 16:07:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2024-11-07 16:07:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2473. [2024-11-07 16:07:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2335 states have (on average 1.2745182012847966) internal successors, (2976), 2356 states have internal predecessors, (2976), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-07 16:07:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3176 transitions. [2024-11-07 16:07:37,326 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3176 transitions. Word has length 144 [2024-11-07 16:07:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:07:37,326 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3176 transitions. [2024-11-07 16:07:37,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 16:07:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3176 transitions. [2024-11-07 16:07:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 16:07:37,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:07:37,328 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:07:37,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-07 16:07:37,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:37,529 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:07:37,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:07:37,530 INFO L85 PathProgramCache]: Analyzing trace with hash 873821541, now seen corresponding path program 3 times [2024-11-07 16:07:37,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:07:37,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772819949] [2024-11-07 16:07:37,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:07:37,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:07:37,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:07:37,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:07:37,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 16:07:38,592 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 16:07:38,593 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:07:38,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 16:07:38,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:07:38,663 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 44 treesize of output 53 [2024-11-07 16:07:39,059 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 454 treesize of output 334 [2024-11-07 16:07:39,070 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 334 treesize of output 214 [2024-11-07 16:07:39,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:07:39,084 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 214 treesize of output 94 [2024-11-07 16:07:40,472 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 164 treesize of output 116 [2024-11-07 16:07:40,479 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 116 treesize of output 68 [2024-11-07 16:07:40,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:07:40,485 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 68 treesize of output 20 [2024-11-07 16:07:40,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:07:40,979 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 214 treesize of output 106 [2024-11-07 16:07:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2024-11-07 16:07:41,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:07:41,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:07:41,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772819949] [2024-11-07 16:07:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772819949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:07:41,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:07:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 16:07:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090126986] [2024-11-07 16:07:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:07:41,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 16:07:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:07:41,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 16:07:41,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:07:41,155 INFO L87 Difference]: Start difference. First operand 2473 states and 3176 transitions. Second operand has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 16:07:44,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:07:48,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:07:52,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:08:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:08:02,291 INFO L93 Difference]: Finished difference Result 3131 states and 4032 transitions. [2024-11-07 16:08:02,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:08:02,292 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 178 [2024-11-07 16:08:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:08:02,301 INFO L225 Difference]: With dead ends: 3131 [2024-11-07 16:08:02,301 INFO L226 Difference]: Without dead ends: 3116 [2024-11-07 16:08:02,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:08:02,302 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 347 mSDsluCounter, 3647 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 4027 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:08:02,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 4027 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 742 Invalid, 2 Unknown, 0 Unchecked, 20.5s Time] [2024-11-07 16:08:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2024-11-07 16:08:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 2750. [2024-11-07 16:08:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2596 states have (on average 1.2646379044684128) internal successors, (3283), 2620 states have internal predecessors, (3283), 108 states have call successors, (108), 41 states have call predecessors, (108), 44 states have return successors, (117), 88 states have call predecessors, (117), 104 states have call successors, (117) [2024-11-07 16:08:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3508 transitions. [2024-11-07 16:08:02,344 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3508 transitions. Word has length 178 [2024-11-07 16:08:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:08:02,344 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 3508 transitions. [2024-11-07 16:08:02,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 16:08:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3508 transitions. [2024-11-07 16:08:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 16:08:02,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:08:02,346 INFO L215 NwaCegarLoop]: trace histogram [68, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:08:02,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-07 16:08:02,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:08:02,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:08:02,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:08:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1522585044, now seen corresponding path program 4 times [2024-11-07 16:08:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:08:02,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914886640] [2024-11-07 16:08:02,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 16:08:02,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:08:02,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:08:02,550 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:08:02,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 (16)] Waiting until timeout for monitored process [2024-11-07 16:08:04,122 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 16:08:04,122 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:08:04,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:08:04,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:08:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-07 16:08:04,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:08:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-07 16:08:04,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:08:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914886640] [2024-11-07 16:08:04,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914886640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:08:04,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:08:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:08:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972801538] [2024-11-07 16:08:04,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:08:04,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:08:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:08:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:08:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:08:04,408 INFO L87 Difference]: Start difference. First operand 2750 states and 3508 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 16:08:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:08:04,665 INFO L93 Difference]: Finished difference Result 2780 states and 3528 transitions. [2024-11-07 16:08:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:08:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 179 [2024-11-07 16:08:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:08:04,674 INFO L225 Difference]: With dead ends: 2780 [2024-11-07 16:08:04,674 INFO L226 Difference]: Without dead ends: 2750 [2024-11-07 16:08:04,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:08:04,676 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 5 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:08:04,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 977 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:08:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2024-11-07 16:08:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2750. [2024-11-07 16:08:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2596 states have (on average 1.2588597842835132) internal successors, (3268), 2620 states have internal predecessors, (3268), 108 states have call successors, (108), 41 states have call predecessors, (108), 44 states have return successors, (117), 88 states have call predecessors, (117), 104 states have call successors, (117) [2024-11-07 16:08:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3493 transitions. [2024-11-07 16:08:04,715 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3493 transitions. Word has length 179 [2024-11-07 16:08:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:08:04,716 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 3493 transitions. [2024-11-07 16:08:04,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 16:08:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3493 transitions. [2024-11-07 16:08:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 16:08:04,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:08:04,721 INFO L215 NwaCegarLoop]: trace histogram [71, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:08:04,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-07 16:08:04,924 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 16:08:04,925 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:08:04,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:08:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 251784997, now seen corresponding path program 5 times [2024-11-07 16:08:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:08:04,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717106131] [2024-11-07 16:08:04,927 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 16:08:04,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:08:04,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:08:04,930 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:08:04,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-07 16:08:09,560 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-07 16:08:09,560 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:08:09,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:08:09,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:08:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1446 proven. 276 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2024-11-07 16:08:10,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:08:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1083 proven. 399 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2024-11-07 16:08:13,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:08:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717106131] [2024-11-07 16:08:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717106131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:08:13,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:08:13,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-07 16:08:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919782102] [2024-11-07 16:08:13,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:08:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 16:08:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:08:13,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 16:08:13,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 16:08:13,352 INFO L87 Difference]: Start difference. First operand 2750 states and 3493 transitions. Second operand has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)